二叉树的中序遍历、先序遍历、后续遍历 Java实现——递归+迭代

• 遍历的结果存储在一个 List 中
• 以下代码的二叉树定义如下：

//二叉树的定义
		 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;
		      }
		  }

中序遍历

递归(中序)

public List<Integer> inOrderTraversal(TreeNode root) {
			    List<Integer> res=new ArrayList<>();
			    inOrder(root,res);
			    return res;
			   }
		 public void inOrder(TreeNode root,List<Integer> res) {
			 if(root==null) return;
			 inOrder(root.left,res);//递归遍历左子树
			 res.add(root.val);//遍历该节点
			 inOrder(root.right,res);//递归遍历右子树
		 }

迭代(中序)

public class Solution {	 
		 public List<Integer> inOrderTraversal(TreeNode root) {
			    List<Integer> res=new ArrayList<>();
			    Deque<TreeNode> stk=new LinkedList<TreeNode>();
			    while(root!=null||!stk.isEmpty()) {
		    		while(root!=null) {
		    			stk.push(root);
		    			root=root.left;
		    		}
		    		root=stk.pop();
		    		res.add(root.val);
		    		root=root.right;
		    	}
			    return res;
			   }	
}

先序遍历

递归(先序)

public List<Integer> preOrderTraversal(TreeNode root) {
			    List<Integer> res=new ArrayList<>();
			    preorder(root,res);
			    return res;
			   }
		 public void preOrder(TreeNode root,List<Integer> res) {
			 if(root==null) return;
			 res.add(root.val);
			 preOrder(root.left,res);
			 preOrder(root.right,res);
		 }

迭代(先序)

     public List<Integer> preOrderTraversal(TreeNode root) {
        List<Integer> res=new ArrayList<>();
        Deque<TreeNode> stk=new LinkedList<>();
        while(root!=null||!stk.isEmpty()) {
            while(root!=null) {
                res.add(root.val);
                stk.push(root);
                root=root.left;
            }
            root=stk.pop();
            root=root.right;
        }
        return res;
        }

后序遍历

递归(后序)

public List<Integer> postOrderTraversal(TreeNode root) {
			    List<Integer> res=new ArrayList<>();
			    postOrder(root,res);
			    return res;
			   }
		 public void postOrder(TreeNode root,List<Integer> res) {
			 if(root==null) return;
			 postOrder(root.left,res);
			 postOrder(root.right,res);
			 res.add(root.val);
		 }

迭代(后序)

     public List<Integer> postOrderTraversal(TreeNode root) {
       List<Integer> res=new ArrayList<>();
			    Deque<TreeNode> stk=new LinkedList<>();
			    TreeNode isVisited = null;
			    while(root != null || !stk.isEmpty()){
			        while(root != null){
			            stk.push(root);
			            root =root.left;
			        }
			        root=stk.pop();
			        if(root.right == null || root.right==isVisited){
			            res.add(root.val);
			            isVisited = root;
			            root = null;
			        }else{
			            stk.push(root);
			            root = root.right;
			        }
			    } 
			    return res;
        }