bst to double linked list

xiaoningning · xiaoningning · commit 85934d30c2d8 · 2012-07-17T23:37:49.000-07:00
diff --git a/PuzzleCoding/src/BSTtoDLL.java b/PuzzleCoding/src/BSTtoDLL.java
@@ -82,12 +82,13 @@ public static void bstToDll1(Node p) {
 
         bstToDll1(p.left);
         p.left = prev;
+        // current node (smallest element) is head of
+        // the list if previous node is not available
         if (prev == null){
             tail = p;
         }
         else{
-            // current node (smallest element) is head of
-            // the list if previous node is not available
+
             prev.right = p;
         }
 

Original file line number	Diff line number	Diff line change
`@@ -82,12 +82,13 @@ public static void bstToDll1(Node p) {`
`82`	`82`
`83`	`83`	`bstToDll1(p.left);`
`84`	`84`	`p.left = prev;`
	`85`	`+ // current node (smallest element) is head of`
	`86`	`+ // the list if previous node is not available`
`85`	`87`	`if (prev == null){`
`86`	`88`	`tail = p;`
`87`	`89`	`}`
`88`	`90`	`else{`
`89`		`- // current node (smallest element) is head of`
`90`		`- // the list if previous node is not available`
	`91`	`+`
`91`	`92`	`prev.right = p;`
`92`	`93`	`}`
`93`	`94`