invert a binary tree

[prakashn27]

Possible solution of max Howel interview question? have to test it before integrating it. http://www.quora.com/What-is-the-algorithmic-approach-to-invert-a-given-binary-tree

[santhoshvai]

that solution is not too good, the one below must work. Basic recursion qn in my opinion.

void reverse(Node root) {
    if (root == null)  return; 
   Node temp = root.Left;
   root.Left = root.Right;
   root.Right = temp;
   reverse(root.Left);
   reverse(root.Right);
}

[prakashn27]

where do we set the left and right tree after inversing??

[santhoshvai]

Lol.. i forgot to add that.. I have edited it now..

[prakashn27]

we will close the issue when we implement the structure and add this code into it.

[santhoshvai]

See https://github.com/AlgorithmCrackers/Interview-Questions/tree/master/04_Trees_and_Graphs/invert-binary-tree