本文實例講述了JS二叉樹的簡單實現方法。分享給大家供大家參考，具體如下：

今天學習了一下 二叉樹的實現，在此記錄一下

簡單的二叉樹實現，并且實現升序和降序排序輸出

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 = inOrder;//中序遍歷(升序)  this.inOrderDesc = inOrderDesc;//中序遍歷(降序)  this.preOrder = preOrder;//先序遍歷  this.postOrder = postOrder;//后續遍歷  this.getMin = getMin;//最大值  this.getMax = getMax;//最小值  this.find = find;//查找值  this.remove = remove;//刪除節點  this.count = count;//獲取節點數量  function insert(data){    //創建一個新的節點    var newNode = new Node(data,null,null);    //判斷是否存在根節點，沒有將新節點存入    if(this.root == null){      this.root = newNode;    }else{      //獲取根節點      var current = this.root;      var parent;      while(true){        //將當前節點保存為父節點        parent = current;        //將小的數據放在左節點        if(data < current.data){          //獲取當前節點的左節點          //判斷當前節點下的左節點是否有數據          current = current.left;          if(current == null){            //如果沒有數據將新節點存入當前節點下的左節點            parent.left = newNode;            break;          }        }else{          current = current.right;          if(current == null){            parent.right = newNode;            break;          }        }      }    }  }  function inOrder(node){    var data = [];    _inOrder(node,data);    return data;  }  function inOrderDesc(node){    var data = [];    _inOrderDesc(node,data);    return data;  }  function preOrder(node){    var data = [];    _preOrder(node,data);    return data;  }  function postOrder(node){    var data = [];    _postOrder(node,data);    return data;  }  function _inOrder(node,data){    if(!(node == null)){      _inOrder(node.left,data);      data.push(node.show());      _inOrder(node.right,data);    }  }  function _inOrderDesc(node,data){    debugger;    if(!(node == null)){      _inOrderDesc(node.right,data);      data.push(node.show());      _inOrderDesc(node.left,data);    }  }  function _preOrder(node,data){    if(!(node == null)){      data.push(node.show());      _preOrder(node.left,data);      _preOrder(node.right,data);    }  }  function _postOrder(node,data){    if(!(node == null)){      _postOrder(node.left,data);      _postOrder(node.right,data);      data.push(node.show());    }  }  function getMin(){    var current = this.root;    while(!(current.left == null)){    current = current.left;    }    return current.data;  }  function getMax(){    var current = this.root;    while(!(current.right == null)){    current = current.right;    }    return current.data;  }  function find(data){    var current = this.root;    while(current != null){      if(data == current.data){        return current;      }else if(data < current.data){        current = current.left;      }else{        current = current.right;      }    }    return null;  }  function getSmallest(node){    var current = node;    while(!(current.left == null)){      current = current.left;    }    return current;  }  function remove(data){    root = removeNode(this.root,data);  }  function removeNode(node,data){    if(node == null){      return null;    }    if(data == node.data){      //如果沒有只節點      if(node.left == null && node.right){        return null;      }      //如果沒有左節點      if(node.left == null){        return node.right;      }      //如果沒有右節點      if(node.right == null){        return node.left;      }      //有兩節點      var tempNode = getSmallest(node.right);      node.data = tempNode.data;      node.right = removeNode(node.right,tempNode.data);      return node;    }else if(data < node.data){      node.left = removeNode(node.left,data);      return node;    }else{      node.right = removeNode(node.right,data);      return node;    }  }  function count(){    var counts = 0;    var current = this.root;    if(current == null){      return counts;    }    return _count(current,counts);  }  function _count(node,counts){    debugger;    if(!(node == null)){      counts ++;      counts = _count(node.left,counts);;      counts = _count(node.right,counts);    }    return counts;  }}