javascript - 为什么当我遍历树时超出了调用堆栈的最大大小？

Question

我试图从二叉树中获取最小值，但收到错误消息，指出超出了最大调用堆栈大小。如何正确获取二叉搜索树中项目的最小值？

这是我的代码 JSBin :

function Node(val){
    this.value = val;
    this.left = null;
    this.right = null;
}

function BinarySearchTree(){
    this.root = null;
}
BinarySearchTree.prototype.minNode =function() {
    var node = this.root;
    if(!node){
        return 0;
    }
    if(node.left){
        return this.minNode(node.left)
    }
    return node.value
}

BinarySearchTree.prototype.push = function(val){
    var root = this.root;

    if(!root){
        this.root = new Node(val);
        return;
    }

    var currentNode = root;
    var newNode = new Node(val);

    while(currentNode){
        if(val < currentNode.value){
            if(!currentNode.left){
                currentNode.left = newNode;
                break;
            }
            else{
                currentNode = currentNode.left;
            }
        }
        else{
            if(!currentNode.right){
                currentNode.right = newNode;
                break;
            }
            else{
                currentNode = currentNode.right;
            }
        }
    }

}

var bt = new BinarySearchTree();
bt.push(23);
bt.push(1);
bt.push(2);
bt.push(25);
console.log(bt.minNode());

Answer 1

就像@AndrewLi提到的。您通过编写再次设置相同的根

var node = this.root;

改为更改函数的定义

BinarySearchTree.prototype.minNode =function(nextNode) {
    var node = nextNode || this.root;
    if(!node){
        return 0;
    }
    if(node.left){
        return this.minNode(node.left)
    }
    return node.value
}