Js实现二叉树的建立以及中序遍历

  class Node {
      constructor(key) {
        this.key = key
        this.left = null
        this.right = null
      }
    }
    const Tree = [8, 13, 6, 3, 9, 45, 1]
    let BinaryTree = new Node()
    function insert(node, e) {
      if (node.key == undefined) {
        node.key = e
        return
      } else {
        if (node.key > e) {
          if (node.left == null) {
            let newNode = new Node()
            node.left = newNode
            insert(node.left, e)
          } else {
            insert(node.left, e)
          }
        } else if (node.key < e) {
          if (node.right == null) {
            let newNode = new Node()
            node.right = newNode
            insert(node.right, e)
          } else {
            insert(node.right, e)
          }
        }
      }
    }
    Tree.forEach(e => {
      insert(BinaryTree, e)
    })
    console.log(BinaryTree)
    //中序遍历
    function inOeder(node) {
      if (node != null) {
        inOeder(node.left)
        console.log(node.key)
        inOeder(node.right)
      }
    }
    inOeder(BinaryTree)