【分享】最新出炉的微软面试题# JobHunting - 待字闺中
q*g
1 楼
1。 Given a value and a binary search tree.
Print all the paths(if there exists more than one) which sum up to that
value. It can be any path in the tree. It doesn't have to be from the root.
2。Implement 3 stacks in a single array as efficiently as possible.
3。 Write the code to print a Binary tree level by level STARTING FROM THE
LEAF LEVEL and then give exhaustive test cases.
eg: 1
2 3
4 5 6 7
Output: 4567231
这道题我用了一个queue和stack，他说不是最优。
4。Whenever you open a file, describe all the steps that th
Print all the paths(if there exists more than one) which sum up to that
value. It can be any path in the tree. It doesn't have to be from the root.
2。Implement 3 stacks in a single array as efficiently as possible.
3。 Write the code to print a Binary tree level by level STARTING FROM THE
LEAF LEVEL and then give exhaustive test cases.
eg: 1
2 3
4 5 6 7
Output: 4567231
这道题我用了一个queue和stack，他说不是最优。
4。Whenever you open a file, describe all the steps that th