update: preorder traversal

ashokdey · ashokdey · commit 7b65d6a90924 · 2019-10-08T13:49:02.000+05:30
diff --git a/src/_DataStructures_/Trees/BST/index.js b/src/_DataStructures_/Trees/BST/index.js
@@ -27,6 +27,15 @@ class BinarySearchTree {
     }
     return root;
   }
+
+  preorder(root) {
+    if (root === null) return;
+    // eslint-disable-next-line no-console
+    console.log(`${root.value} `);
+
+    this.preorder(root.leftChild);
+    this.preorder(root.rightChild);
+  }
 }
 
 // const bst = new BinarySearchTree(10);
@@ -39,4 +48,6 @@ class BinarySearchTree {
 
 // console.log(bst.root);
 
+// bst.preorder(bst.root);
+
 module.exports = BinarySearchTree;

Original file line number	Diff line number	Diff line change
`@@ -27,6 +27,15 @@ class BinarySearchTree {`
`27`	`27`	`}`
`28`	`28`	`return root;`
`29`	`29`	`}`
	`30`	`+`
	`31`	`+ preorder(root) {`
	`32`	`+ if (root === null) return;`
	`33`	`+ // eslint-disable-next-line no-console`
	`34`	+ console.log(`${root.value} `);
	`35`	`+`
	`36`	`+ this.preorder(root.leftChild);`
	`37`	`+ this.preorder(root.rightChild);`
	`38`	`+ }`
`30`	`39`	`}`
`31`	`40`
`32`	`41`	`// const bst = new BinarySearchTree(10);`
`@@ -39,4 +48,6 @@ class BinarySearchTree {`
`39`	`48`
`40`	`49`	`// console.log(bst.root);`
`41`	`50`
	`51`	`+// bst.preorder(bst.root);`
	`52`	`+`
`42`	`53`	`module.exports = BinarySearchTree;`