(144,145,94)LeetCode树的前中后序遍历——java（迭代法）

前序遍历：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
         List<Integer> result=new ArrayList<Integer>();
        if(root==null)
        {
            return result;
        }
         
          Stack<TreeNode> stack=new  Stack<>();
          stack.push(root);
          while(!stack.isEmpty())
          {
            TreeNode node=stack.pop();
            result.add(node.val);
            //先入右节点，使出栈是的顺序为中左右
             if(node.right!=null)
            {
                stack.push(node.right);
            }
            if(node.left!=null)
            {
                stack.push(node.left);
            }
          }
          return result;
    }

}

中序遍历：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<Integer> inorderTraversal(TreeNode root) {
        List<Integer> result=new ArrayList<Integer>();
        if(root==null)
        {
            return result;
        }
         
          Stack<TreeNode> stack=new  Stack<>();
          TreeNode cur=root;
          while(cur!=null|!stack.isEmpty())
          {
              if(cur!=null)
            {
                stack.push(cur);
                cur=cur.left;
            }else
            {
                cur=stack.pop();
                result.add(cur.val);
                cur=cur.right;
            }
          }
          return result;
     }
}

后序遍历：

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public List<Integer> postorderTraversal(TreeNode root) {
         List<Integer> result=new ArrayList<Integer>();
        if(root==null)
        {
            return result;
        }
         
          Stack<TreeNode> stack=new  Stack<>();
          stack.push(root);
          while(!stack.isEmpty())
          {
             TreeNode node=stack.pop();
             result.add(node.val);
             
            if(node.left!=null)
            {
                stack.push(node.left);
            }
             if(node.right!=null)
            {
                stack.push(node.right);
            }
          }
          Collections.reverse(result);
          return result;
    }
 
}