java二叉树找最大值_JavaScript数据结构与算法之二叉树实现查找最小值、最大值、给定值算法示例...

本文实例讲述了JavaScript数据结构与算法之二叉树实现查找最小值、最大值、给定值算法。分享给大家供大家参考，具体如下：

function Node(data,left,right) {

this.data = data;

this.left = left;

this.right = right;

this.show = show;

}

function show() {

return this.data;

}

function BST() {

this.root = null;

this.insert = insert;

this.preOrder = preOrder;

this.inOrder = inOrder;

this.postOrder = postOrder;

this.getMin = getMin;//查找最小值

this.getMax = getMax;//查找最大值

this.find = find;//查找给定值

}

function insert(data) {

var n = new Node(data,null,null);

if(this.root == null) {

this.root = n;

}else {

var current = this.root;

var parent;

while(current) {