clean tree leaf path code

xiaoningning · xiaoningning · commit cf658c2d090a · 2012-07-11T19:14:14.000-07:00
diff --git a/PuzzleCoding/src/TreeLeafPath.java b/PuzzleCoding/src/TreeLeafPath.java
@@ -5,15 +5,14 @@
 /**
  * print out all leaf node path with non recursive method
  * The structure of node is *NOT* binary tree, is just a normal tree.
- * <p/>
- * <p/>
- * // print out all leaf node path
+ *
+ * print out all leaf node path
  * //              12
  * //    4         8        22
  * //1  2  3     9     18   24
- * <p/>
+ *
  * the output is like:
- * <p/>
+ *
  * 12, 4, 1,
  * 12, 4, 2,
  * 12, 4, 3,
@@ -78,6 +77,9 @@ public static void main(String[] args) {
         TreeLeafPath node9 = new TreeLeafPath(9);
         TreeLeafPath node18 = new TreeLeafPath(18);
         TreeLeafPath node22 = new TreeLeafPath(22);
+        TreeLeafPath node16 = new TreeLeafPath(16);
+
+        node18.addTree(node16);
         node18.addTree(node22);
         node8.addTree(node9);
         node8.addTree(node18);
