LeetCode #226 challenge: Given a binary tree, write an algorithm to invert the tree and return its root — Given the root of a binary tree, invert the tree, and return its root. Example: Input: root = [4,2,7,1,3,6,9]
Output: [4,7,2,9,6,3,1] This challenge can be easily solved recursively. We need to write a method that inverts the given binary tree by swapping the left and right nodes and recursively performing the…