Amazon Interview Question

Country: India

Comment hidden because of low score. Click to expand.
of 1 vote

public void buildDLstWrapper( Node root)
    Node prev = null;

public void buildDLst( Node root, Node prev)
            prev.right = root;
        root.left = prev;
        prev = root;
        buildDLst(root.right, prev);

- sankarmail February 05, 2012 | Flag Reply
Comment hidden because of low score. Click to expand.
of 0 votes

The above one is for BST

- sankarmail February 05, 2012 | Flag
Comment hidden because of low score. Click to expand.
of 0 vote

Copy all the elements into array O(n) space O(n) time
Sort the array O(nlogn) time
make a doubly linked list O(n) time
Complexity upper bound: O(n)space O(nlogn) time

If the tree were binary search tree then there exist algorithm to convert the same tree in to sorted doubly linked list

- zino January 29, 2012 | Flag Reply

Add a Comment

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.


is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More


CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More