【 以下文字转载自 JobHunting 讨论区 】
发信人: qqxiang (香香), 信区: JobHunting
标 题: 【分享】最新出炉的微软面试题
发信站: BBS 未名空间站 (Sun May 6 23:13:35 2007)
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 cas
