Tree Interview Questions
(Posted anonymously by job candidates)
| 31 Interview Questions: 21–30 of 31 | Sort by |
Jan 17, 2011
Interview Question for Software Engineer at Facebook:
|
“Print a binary tree in infix order. Recursive and iterative.” |
Dec 9, 2010
Interview Question for Software Engineer at Facebook:
|
“Find the minimum depth of binary search tree” |
May 1, 2010
Interview Question for Software Engineer at Amazon.com:
|
“Given a binary tree, how do you create a function that can swap the binary tree? (i.e. the left child becomes the right child and vice versa) |
Mar 11, 2010
Interview Question for Software Engineering at AppFirst:
|
“Given a tree, print the in order traversal of values, depth by depth.” |
Jan 24, 2010
Interview Question for Software Engineer at Google:
|
“Define binary search tree. Develop a procedure to verify a binary search tree.” |
Oct 15, 2009
Interview Question for Software Development Engineer at Amazon.com:
|
“Find the deepest common ancestor of two nodes in a tree structure.” |
Oct 15, 2009
Interview Question for Software Development Engineer at Amazon.com:
|
“Given a time-ordered log of user visits to web pages find the most common 3-page sequence” |
Jun 13, 2009
Interview Question for Software Development Engineer In Test (SDET) at Microsoft:
|
“using recursion to traverse a binary tree” |
May 12, 2009
Interview Question for Senior Software Engineer at HTC:
|
“Find the common ancestor of two nodes in a tree. The tree is not a binary tree strictly in that the left node is less than the right node. Also this solution should work for trees with three or four children. Provide both a recursive and iterative solution.” |
Mar 19, 2009
Interview Question for Software Engineer Intern at Motorola Mobility:
|
“Given the root node of a tree, write two Java programs to visit all nodes of the tree, one in a depth-first fashion and the other in a breadth-first fashion, both without using recursion. Assume a node is represented by a class named Node, which has a method children() that returns a list of child nodes. Call node.visit() to visit a node.” |
