SOLUTE interview question
Reverse the objects in the binary tree.
Interview Answer
Anonymous
2 May 2019
void reverse(Node* root) { if(root == NULL) return; else return swap(reverse(root->left), reverse(root->right)) } then just make a swap function
Reverse the objects in the binary tree.
Anonymous
void reverse(Node* root) { if(root == NULL) return; else return swap(reverse(root->left), reverse(root->right)) } then just make a swap function
Check out your Company Bowl for anonymous work chats.