前序中序后序非递归Java版

前序遍历

public void preOrder(TreeNode root)
{
  Stack<TreeNode> stack = new Stack<>();
  TreeNode node = root;
  while(node!=null || !stack.isEmpty())
  {
    if(node!=null)
    {
      System.out.println(node.value);
      stack.push(node);
      node = node.left;
    }
    else
    {
      node = stack.pop();
      node = node.right;
    }
  }
}

中序遍历

public void inOrder(TreeNode root){
  Stack<TreeNode> stack = new Stack<>();
  TreeNode node = root;
  while(node!=null || !stack.isEmpty()){
    if(node!=null){
      stack.push(node);
      node = node.left;
    }else{
      node = stack.pop();
      System.out.println(node.value);
      node = node.right;
    }
  }
}

后序遍历

public void postOrder(TreeNode root){
  Stack<TreeNode> s1 = new Stack();
  Stack<TreeNode> s2 = new Stack();
  TreeNode node = root;
  s1.push(node);
  while(!s1.empty()){
    node = s1.pop();
    s2.push(node);
    if(node.left!=null) s1.push(node.left)
    if(node.right!=null) s1.push(node.right);
  }
  while(!s2.empty()){
    node = s2.pop();
    System.out.println(node.value);
  }
}