es6 --- > 使用yield*命令遍历完全二叉树

首先定义二叉树的结构:

// 定义二叉树的结构
function Tree(left, label, right) {
    this.left = left;
    this.label = label;
    this.right = right;
}

// 对二叉树采用中序遍历
function* inorder(t) {
    if(t) {
        yield* inorder(t.left);
        yield t.label;
        yield* inorder(t.right);
    }
}

// 生成二叉树
function make(array) {
    if (array.length === 1) return new Tree(null, array[0], null);
    return new Tree(make(array[0]), array[1], make(array[2]));
}

let tree = make([['a'], 'b', ['c']], 'd', [['e'], 'f', ['g']]]);

// 遍历二叉树
var result = [];
for (let node of inorder(tree)) {
    result.push(node);
}
console.log(result);

参考《ES6标准入门》(第3版)P341