xiaojinglyd的博客

二叉树创建 function BinaryTree() { this.root = null; this.insert = function (key) { var node = new BinaryNode(key); if (this.root) { this._insertNode(node, this.root); } else { this.root = new BinaryNode(key); }

二叉树遍历顺序 四种遍历方式 先/前序遍历、中序遍历、后序遍历、层序遍历 测试二叉树创建 function BinaryTree() { this.root = null; this.insert = function (key) { var node = new BinaryNode(key); if (this.root) { this._insertNode(node, this.root); } else { this.root = new BinaryNode(key)