Amazon.com

  www.amazon.com
Work in HR? Unlock Free Profile

Amazon.com Summer Software Development Engineer Intern Interview Question

"Binary Tree level order traversal. In-order traversal a BST tree that each node points to its parent and all leaves link to each other(SLL). Find the last k fibonacci numbers that are smaller than n."
Add Tags [?]
Answer

Part of a Summer Software Development Engineer Intern Interview Review - one of 4,635 Amazon.com Interview Reviews

To comment on this question, Sign In with Facebook or Sign Up

Tags are like keywords, helping to categorise interview questions that have something in common.