二叉树的先中后序遍历（JavaScript非递归版）

1.先序遍历：

const preorder = (root) => {
  if (!root) { return; }
  const stack = [root];
  while (stack.length) {
    const n = stack.pop();
    console.log(n.val);
    if (n.right) stack.push(n.right);
    if (n.left) stack.push(n.left);

  }
}

preorder(bt);

2.中序遍历：

const inorder = (root) => {
  if (!root) { return; }
  const stack = [];
  let p = root;
  while (stack.length || p) {
    while (p) {
      stack.push(p);
      p = p.left;
    }
    const n = stack.pop();
    console.log(n.val);
    p = n.right;
  }
}

inorder(root);

3.后序遍历：

const postorder = (root) => {
  if (!root) { return; }
  const outputStack = [];
  const stack = [root];
  while (stack.length) {
    const n = stack.pop();
    outputStack.push(n);
    if (n.left) stack.push(n.left);
    if (n.right) stack.push(n.right)
  }
  while (outputStack.length) {
    const n = outputStack.pop();
    console.log(n.val);
  }
}

postorder(bt);