<script type="text/javascript">
// <![CDATA[
 //打印輸出
 function println(msg) {
  document.write(msg + " ");
 }
 //節(jié)點(diǎn)類(lèi)
 var Node = function (v) {
  this.data = v; //節(jié)點(diǎn)值
  this.left = null; //左節(jié)點(diǎn)
  this.right = null; //右節(jié)點(diǎn)
 }
 //二叉搜索樹(shù)類(lèi)
 var BinarySearchTree = function () {
  this.root = null; //初始化時(shí),根節(jié)點(diǎn)為空
  //插入節(jié)點(diǎn)
  //參數(shù)：v 為節(jié)點(diǎn)的值
  this.insert = function (v) {
   var newNode = new Node(v);
   if (this.root == null) {
    //樹(shù)為空時(shí)，新節(jié)點(diǎn)，直接成為根節(jié)點(diǎn)
    this.root = newNode;
    return;
   }
   var currentNode = this.root; //工作“指針”節(jié)點(diǎn)（從根開(kāi)始向下找）
   var parentNode = null;
   while (true) {
    parentNode = currentNode;
    if (v < currentNode.data) {
     //當(dāng)前節(jié)點(diǎn)的值 > 目標(biāo)節(jié)點(diǎn)的值     
     //應(yīng)該向左插，工作節(jié)點(diǎn)移到左節(jié)點(diǎn)
     currentNode = currentNode.left;
     if (currentNode == null) {
      //沒(méi)有左節(jié)點(diǎn)，則新節(jié)點(diǎn)，直接成為左節(jié)點(diǎn)
      parentNode.left = newNode;
      return; //退出循環(huán)
     }
    }
    else {
     //否則向右插，工作節(jié)點(diǎn)移到右節(jié)點(diǎn)
     currentNode = currentNode.right;
     if (currentNode == null) {
      parentNode.right = newNode;
      return;
     }
    }
   }
  }
  //查找最小節(jié)點(diǎn)
  this.min = function () {
   var p = this.root; //工作節(jié)點(diǎn) 
   while (p != null && p.left != null) {
    p = p.left;
   }
   return p;
  }
  //查找最大節(jié)點(diǎn)
  this.max = function () {
   var p = this.root; //工作節(jié)點(diǎn) 
   while (p != null && p.right != null) {
    p = p.right;
   }
   return p;
  }
  //中序遍歷
  this.inOrder = function (rootNode) {
   if (rootNode != null) {
    this.inOrder(rootNode.left); //先左節(jié)點(diǎn)
    println(rootNode.data); //再根節(jié)點(diǎn)
    this.inOrder(rootNode.right); //再右節(jié)點(diǎn)
   }
  }
  //先序遍歷
  this.preOrder = function (rootNode) {
   if (rootNode != null) {
    println(rootNode.data); //先根
    this.preOrder(rootNode.left); //再左節(jié)點(diǎn)
    this.preOrder(rootNode.right); //再右節(jié)點(diǎn)
   }
  }
  //后序遍歷
  this.postOrder = function (rootNode) {
   if (rootNode != null) {
    this.postOrder(rootNode.left); //先左節(jié)點(diǎn)
    this.postOrder(rootNode.right); //再右節(jié)點(diǎn)
    println(rootNode.data); //再根節(jié)點(diǎn)
   }
  }
 }
 //以下是測(cè)試
 var bTree = new BinarySearchTree();
 //《沙特.算法設(shè)計(jì)技巧與分析》書(shū)上圖3.9 左側(cè)的樹(shù)
 bTree.insert(6);
 bTree.insert(3);
 bTree.insert(8);
 bTree.insert(1);
 bTree.insert(4);
 bTree.insert(9);
 println('中序遍歷：')
 bTree.inOrder(bTree.root);
 println("<br/>");
 println("先序遍歷：");
 bTree.preOrder(bTree.root);
 println("<br/>");
 println("后序遍歷：");
 bTree.postOrder(bTree.root);
 println("<br/>");
 var minNode = bTree.min();
 println("最小節(jié)點(diǎn)：" + (minNode == null ? "不存在" : minNode.data));
 println("<br/>");
 var maxNode = bTree.max();
 println("最大節(jié)點(diǎn)：" + (maxNode == null ? "不存在" : maxNode.data));
// ]]>
</script>
<!--中序遍歷： 1 3 4 6 8 9 <br> 先序遍歷： 6 3 1 4 8 9 <br> 后序遍歷： 1 4 3 9 8 6 <br> 最小節(jié)點(diǎn)：1 <br> 最大節(jié)點(diǎn)：9-->

中序遍歷： 1 3 4 6 8 9 
先序遍歷： 6 3 1 4 8 9 
后序遍歷： 1 4 3 9 8 6 
最小節(jié)點(diǎn)：1 
最大節(jié)點(diǎn)：9