randomize the key of bst

Author: 64json

algorithm/tree/binary_search_tree/bst_search/code.js

@@ -1,27 +1,21 @@
-function bst ( item, node, parent ) { // node = current node , parent = previous node
-	tracer._visit ( node, parent )._wait ();
-	if ( item === node ) { 			// key found 
-		tracer2._select ( 0 )._wait();
-		logger._print ( ' Match Found ' );
-	} else if ( item < node ) { 	// key less than value of current node
-		if( T[node][0] === -1 ) {
-			tracer2._notify ( 0, item )._wait();
-			logger._print ( ' Not Found ');
-		} else {
-			tracer2._notify ( 0, item )._wait();
-			bst ( item, T[node][0], node );
-			tracer2._denotify ( 0 );
-		}
-	} else {						// key greater than value of current node 
-		if ( T[node][1] === -1 ) {
-			tracer2._notify ( 0, item )._wait();
-			logger._print ( ' Not Found ');
-		} else {
-			tracer2._notify ( 0, item )._wait();
-			bst ( item, T[node][1], node );
-			tracer2._denotify ( 0 );
-		}
-	}
+function bst(item, node, parent) { // node = current node , parent = previous node
+  tracer._visit(node, parent)._wait();
+  if (item === node) { 			// key found
+    logger._print(' Match Found ');
+  } else if (item < node) { 	// key less than value of current node
+    if (T[node][0] === -1) {
+      logger._print(' Not Found ');
+    } else {
+      bst(item, T[node][0], node);
+    }
+  } else {						// key greater than value of current node
+    if (T[node][1] === -1) {
+      logger._print(' Not Found ');
+    } else {
+      bst(item, T[node][1], node);
+    }
+  }
 }
 
-bst ( key[0], 5 ); // node with key 5 is the root
+logger._print('Finding number ' + key);
+bst(key, 5); // node with key 5 is the root

algorithm/tree/binary_search_tree/bst_search/data.js

@@ -1,34 +1,33 @@
 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, 0, 0, 0, 0],
-    [0, 1, 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, 0, 0, 0, 1, 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, 0, 0, 0, 0, 0, 1, 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]
+  [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, 0, 0, 0, 0],
+  [0, 1, 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, 0, 0, 0, 1, 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, 0, 0, 0, 0, 0, 1, 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,-1],
-        [ 1, 4],
-        [-1,-1],
-        [ 3, 8],
-        [-1, 7],
-        [-1,-1],
-        [ 6,10],
-        [-1,-1],
-        [ 9,-1]
+  [-1, -1],
+  [0, 2],
+  [-1, -1],
+  [1, 4],
+  [-1, -1],
+  [3, 8],
+  [-1, 7],
+  [-1, -1],
+  [6, 10],
+  [-1, -1],
+  [9, -1]
 ];
 
-var key = [2]; // item to be searched
-var tracer = new DirectedGraphTracer( " Binary Search Tree ")._setTreeData ( G, 5 );
-var tracer2 = new Array1DTracer ( " Key ")._setData ( key );
-var logger = new LogTracer ( " Log ");
-tracer.attach ( logger );
+var key = Math.random() * G.length | 0; // item to be searched
+var tracer = new DirectedGraphTracer(" Binary Search Tree ")._setTreeData(G, 5);
+var logger = new LogTracer(" Log ");
+tracer.attach(logger);