3.4 of 5 2,818 reviews Seattle, WA 5000+ Employees 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 Flag Question

Part of a Summer Software Development Engineer Intern Interview Review - one of 4,156 Interview Reviews

To comment on this question, Sign In with Facebook or Sign Up – Why Work for Us?

Not ready to apply yet? Click here to join our Talent communities, where you can learn more about us and stay up-to-date with Amazonian opportunities! Full Overview

Provided by employer [?]

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

Glassdoor is your free inside look at interview questions and advice. All interview reviews are posted anonymously by employees and interview candidates.