Google phone screen round
Anonymous User
365

I was asked:

  1. Construct Binary Tree from Inorder and Postorder Traversal

I did this but follow up was like, what if tree contains duplicates?
I gave brute force.

Is there any optimal soution to handle duplicates?

Comments (2)