JavaScript基础算法：二叉树 插入数据、前中后序遍历 查找最小值和最大值、给定值

// 定义BST类  Node类
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.inOrder = inOrber;
}

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 (true) {
      parent = current;
      if (data < current.data) {
        current = current.left;
        if (current == null) {
          parent.left = n;
          break;
        }
      } else {
        current = current.right;
        if (current == null) {
          parent.right = n;
          break;
        }
      }
    }
  }
}

var nums = new BST();

nums.insert(23);
nums.insert(45);
nums.insert(16);
nums.insert(37);
nums.insert(3);
nums.insert(99);
nums.insert(22);

//中序遍历方法
function inOrber(node) {
  if (!(node == null)) {
    inOrber(node.left);
    document.write(node.show() + " ");
    inOrber(node.right);
  }
}

//中序遍历方法执行
document.write("中序");
document.write("<br>");
nums.inOrder(nums.root);
document.write("<br>");

//前序遍历方法
function preOrder(node) {
  if (!(node == null)) {
    document.write(node.show() + " ");
    inOrber(node.left);
    inOrber(node.right);
  }
}
//前序遍历方法执行
document.write("前序");
document.write("<br>");
preOrder(nums.root);
document.write("<br>");

//后序遍历方法
function postOrder(node) {
  if (!(node == null)) {
    inOrber(node.left);
    inOrber(node.right);
    document.write(node.show() + " ");
  }
}

//后序遍历方法执行
document.write("后序");
document.write("<br>");
postOrder(nums.root);



//查找最小值
function getMin(data) {
    var current=data;
    while (!(current.left==null)){
      current=current.left;
    }
    return current.data;
}


//查找最大值
function getMax(data) {
  var current=data;
  while (!(current.right==null)){
    current=current.right;
  }
  return current.data;
}

//查找给定值
function find(data,finds) {
  var current=data;
  while (current!=null){
    if (current.data==finds){
      return current
    }else if (finds<current.data){
      current=current.left;
    }else {
      current=current.right;
    }
  }
  return null;
}