This function is not reversing the tree, it swapping the left and
right sub trees. for ex.
6
5 8
4 7 9
1 11
2
=>
6
8 5
9 4
11 1
2
i hope you get my point.
Siddhant Khanna
On Feb 9, 7:38 pm, Rahul Menon <menonrahul1...@gmail.com> wrote:
> What does this function do?
>
> void function(Node **node){
> if(*node!=NULL){
> function(&(*node)->Left);
> Node *temp;
> temp = (*node)->Left;
> (*node)->Left= (*node)->Right;
> (*node)->Right = temp;
> function(&(*node)->Right);
> }
>
>
>
>
>
>
>
> }
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
