Revise LCA visualization

archie94 · archie94 · commit 92e09c4a342d · 2016-07-15T00:29:13.000+05:30
diff --git a/algorithm/tree/lowest_common_ancestor/binary_tree/code.js b/algorithm/tree/lowest_common_ancestor/binary_tree/code.js
@@ -21,5 +21,5 @@ function lcaBT (parent, root, a, b) {
     return (left !== null ? left : right);
 }
 
-var a = 7, b = 9;
+var a = 7, b = 2;
 logger._print ('Lowest common ancestor of ' + a + ' & ' + b + ' is: ' + lcaBT (null, 5, a, b));
diff --git a/algorithm/tree/lowest_common_ancestor/binary_tree/data.js b/algorithm/tree/lowest_common_ancestor/binary_tree/data.js
@@ -1,28 +1,28 @@
 var G = [ // G[i][j] indicates whether the path from the i-th node to the j-th node exists or not
     [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
-    [1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0],
+    [0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0],
     [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
-    [0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0],
+    [0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0],
     [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
     [0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0],
-    [0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0],
+    [1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0],
     [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
-    [0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1],
+    [0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1],
     [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
     [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
 ];
 
 
 var T = [ // mapping to G as a binary tree , [i][0] indicates left child, [i][1] indicates right child
         [-1,-1],
-        [ 0, 2],
+        [-1, 7],
         [-1,-1],
-        [ 1, 4],
+        [ 6, 1],
         [-1,-1],
         [ 3, 8],
-        [-1, 7],
+        [ 0, 2],
         [-1,-1],
-        [ 6,10],
+        [10, 4],
         [-1,-1],
         [ 9,-1]
 ];

Original file line number	Diff line number	Diff line change
`@@ -21,5 +21,5 @@ function lcaBT (parent, root, a, b) {`
`21`	`21`	`return (left !== null ? left : right);`
`22`	`22`	`}`
`23`	`23`
`24`		`-var a = 7, b = 9;`
	`24`	`+var a = 7, b = 2;`
`25`	`25`	`logger._print ('Lowest common ancestor of ' + a + ' & ' + b + ' is: ' + lcaBT (null, 5, a, b));`