Amazon | Phone Screen | Find Node in a Sorted Binary Tree
Anonymous User
1139
TreeAmazonPhone ScreeningInterview

Position: SDE2

A binary tree is level order sorted (Each level is sorted). Find a given node. Could you do better than O(n). Eg. Could you find 10 in below eg faster than O(n)

         1
       /   \
     2      3     
    / \    / \
  8    9 10   11
Comments (5)