We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 0852027 commit dd6e29bCopy full SHA for dd6e29b
chapter08/01-BinarySearchTree.js
@@ -103,23 +103,29 @@ function BinarySearchTree() {
103
};
104
105
var minNode = function (node) {
106
- while (node && node.left !== null) {
107
- node = node.left;
108
- }
+ if (node){
+ while (node && node.left !== null) {
+ node = node.left;
109
+ }
110
- return node.key;
111
+ return node.key;
112
113
+ return null;
114
115
116
this.max = function() {
117
return maxNode(root);
118
119
120
var maxNode = function (node) {
- while (node && node.right !== null) {
- node = node.right;
121
122
+ while (node && node.right !== null) {
123
+ node = node.right;
124
125
126
127
128
129
130
131
this.remove = function(element){
0 commit comments