Coding question: write a function that returns the node with maximum imbalance (ie maximum difference in heights of left and right subtree)
Anonymous
I was able to give a naive solution using recursion with O^n time complexity
Check out your Company Bowl for anonymous work chats.