Software Development Engineer Interview Questions

33,184 software development engineer interview questions shared by candidates

Given a tree of order n which is neither complete or a search tree, write a function to construct a new tree of order m in-place. Memory usage is bound to 2 times the size of the tree. The new tree must be complete, and a node A cannot be a child of another node B in the new tree if A was an ancestor of B in the old tree.
avatar

Software Development Engineer

Interviewed at Microsoft

4
Jan 13, 2017

Given a tree of order n which is neither complete or a search tree, write a function to construct a new tree of order m in-place. Memory usage is bound to 2 times the size of the tree. The new tree must be complete, and a node A cannot be a child of another node B in the new tree if A was an ancestor of B in the old tree.

Viewing 971 - 980 interview questions

Glassdoor has 33,184 interview questions and reports from Software development engineer interviews. Prepare for your interview. Get hired. Love your job.