上一篇:
前端必会算法——二叉树的前序遍历
二叉树的中序遍历
代码演示:
function Node(value) {
this.value = value;
this.left = null;
this.right = null;
}
var a = new Node("a");
var b = new Node("b");
var c = new Node("c");
var b = new Node("d");
var d = new Node("e");
var f = new Node("f");
var g = new Node("g");
a.left = c;
a.right = b;
c.left = f;
c.right = g;
b.left = d;
b.right = e;
function fn1(root) {
if (root === null) return;
fn1(root.left);
console.log(root.value); // 中序遍历,在中间打印root.value
fn1(root.right);
}
fn1(a);
运行结果:
下一篇:
前端必会算法——二叉树的后序遍历