java-4.-在二元树中找出和为某一值的所有路径 .
Java代码[code]1./*
2. * 0.use a TwoWayLinkedList to store the path.when the node can't be path,you should/can delete it.
3. * 1.curSum==exceptedSum:if the lastNode is TreeNode,printPath();delete the node otherwise
4. * 2.curSum>exceptedSum:return;
5. * 3.curSum
by
中关村村草
-
Java
-
2012-01-09 15:19:07 阅读(996) 回复(1)