Skip to contentSkip to footer
      employer cover photo
      employer logo
      employer logo

      Amazon

      Engaged Employer

      Amazon Technical Program Manager interview

      Amazon Interview Question

      Technical Program Manager Interview

      What is the look up time for a tree?

      Interview Answers

      Anonymous

      Jan 28, 2014

      O(log n) if it's a binary tree and balanced.

      Anonymous

      Jan 2, 2014

      O(n) worst case without constraints. O(log n ) worst case if balanced.

      Related searches: Amazon reviews | Amazon jobs | Amazon salaries | Amazon benefits | Amazon conversations
      Amazon interviews