6.2 二叉树的迭代遍历（前序、中序、后序）——【LeetCode】

//迭代遍历
public class two {

}


class Solution{
	//前序遍历
	public List<Integer> preorderTraversal(TreeNode root){
		List<Integer> result = new ArrayList<>();
		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;
	}
	
	
	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 Solution2{
	 public List<Integer> inorderTraversal(TreeNode root) {
		 List<Integer> result = new ArrayList<>();
        if (root == null){
            return result;
        }
        Stack<TreeNode> stack = new Stack<>();
        TreeNode cur = root;
        while(cur != null || !stack.isEmpty()) {
        	if(cur != null) {//这里可以看出cur 利用while循环一直寻找到了最左边的叶子结点
        		stack.push(cur);
        		cur = cur.left;
        	}else {
        		cur = stack.pop();//用cur来接收
        		result.add(cur.val);
        		cur = cur.right;
        	}
        }
        return result;
	 }
	 
	 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 Solution3{
	 public List<Integer> postorderTraversal(TreeNode root) {
		 List<Integer> result = new ArrayList<>();
		 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;
	 }
	 
	 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;
		    }
		}
}