@@ -108,6 +108,12 @@ class BinarySearchTree {
108108 return root ;
109109 }
110110
111+ findMinNode ( root ) {
112+ /** The minnimum values is the let most leaf node in BST */
113+ if ( root . leftChild === null ) return root ;
114+ return this . findMinNode ( root . leftChild ) ;
115+ }
116+ 111117 isEmpty ( ) {
112118 return this . root === null ;
113119 }
@@ -134,6 +140,11 @@ class BinarySearchTree {
134140 return this . search ( this . root , value ) ;
135141 }
136142
143+ findMinimum ( ) {
144+ const minNode = this . findMinNode ( this . root ) ;
145+ return minNode . value ;
146+ }
147+ 137148 remove ( value ) {
138149 return this . delete ( this . root , value ) ;
139150 }
@@ -162,8 +173,12 @@ class BinarySearchTree {
162173// const search = 18;
163174// console.log(`Search for ${search}`, bst.searchFor(search));
164175
176+ // const minNode = bst.findMinimum();
177+ // console.log('Minimum value =>', minNode);
178+ 165179// bst.remove(8);
166180// console.log(bst.traversePreorder());
181+ // console.log(bst.root);
167182
168183// bst.remove(5);
169184// console.log(bst.traversePreorder());
0 commit comments