Invert Binary Tree
The classic algorithm problem that you see on all the coding interview prep advertisement sites! The challenge is simple: Write a function that takes in a Binary Tree and Inverts It. In other words, the function should swap every left node in the tree for its corresponding right node.
Each BinaryTree node has an integer value, a left child node, and a right child node. Children nodes can either be BinaryTree nodes themselves or None / null / nil.
Business Rules/Errata
- The operation should modify the input tree - other objects should not be created to complete this challenge.
Examples
Sample Input
tree = 1
/ \
2 3
/ \ / \
4 5 6 7
/ \
8 9
Sample Output
tree = 1
/ \
3 2
/ \ / \
7 6 5 4
/ \
9 8
Invert Binary Tree
The classic algorithm problem that you see on all the coding interview prep advertisement sites! The challenge is simple: Write a function that takes in a Binary Tree and Inverts It. In other words, the function should swap every left node in the tree for its corresponding right node.
Each BinaryTree node has an integer value, a left child node, and a right child node. Children nodes can either be BinaryTree nodes themselves or None / null / nil.
Business Rules/Errata
Examples
Sample Input
Sample Output