[二叉树的前序、中序、后序遍历（递归与非递归）]

二叉树的前序、中序、后序遍历（递归与非递归）

递归

前序

static class Solution {
        public List<Integer> preorderTraversal(TreeNode root) {
            List<Integer> list = new ArrayList<>();
            preTraverse(root, list);
            return list;
        }

        public void preTraverse(TreeNode root, List<Integer> list) {
            if (root != null) {
            	list.add(root.val);
                preTraverse(root.left, list);
                preTraverse(root.right, list);
            }
        }
    }

中序

static class Solution {
        public List<Integer> inorderTraversal(TreeNode root) {
            List<Integer> list = new ArrayList<>();
            midTraverse(root, list);
            return list;
        }

        public void midTraverse(TreeNode root, List<Integer> list) {
            if (root != null) {
                midTraverse(root.left, list);
                list.add(root.val);
                midTraverse(root.right, list);
            }
        }
    }

后序

static class Solution {
        public List<Integer> postorderTraversal(TreeNode root) {
            List<Integer> list = new ArrayList<>();
            postTraverse(root, list);
            return list;
        }

        public void postTraverse(TreeNode root, List<Integer> list) {
            if (root != null) {
                postTraverse(root.left, list);
                postTraverse(root.right, list);
                list.add(root.val);
            }
        }
    }

非递归

前序

class Solution {
    public List<Integer> preorderTraversal(TreeNode root) {
        List<Integer> list = new ArrayList<>();
        Stack<TreeNode> stack = new Stack<TreeNode>();
        if (root != null) {
            stack.add(root);
            while (stack.size() != 0) {
                TreeNode t = stack.pop();
                list.add(t.val);
                if (t.right != null) {
                    stack.push(t.right);
                }
                if (t.left != null) {
                    stack.push(t.left);
                }
            }
        }
        return list;
    }
}

中序

class Solution {
    public List<Integer> inorderTraversal(TreeNode root) {
        List<Integer> list = new ArrayList<>();
        Stack<TreeNode> stack = new Stack<>();
        TreeNode current = root;
        while (!stack.isEmpty() || current != null) {
            while (current != null) {
                stack.push(current);
                current = current.left;
            }
            if(!stack.isEmpty()) {
                current = stack.pop();
                list.add(current.val);
                current = current.right;
            }
        }
        return list;
    }
}

后序

class Solution {
    public List<Integer> postorderTraversal(TreeNode root) {
        List<Integer> list = new ArrayList<>();
        Stack<TreeNode> stack = new Stack<TreeNode>();
        TreeNode current = root;
        TreeNode lastVisit = root;
        while (current != null) {
            stack.push(current);
            current = current.left;
        }
        while (!stack.isEmpty()) {
            current = stack.pop();
            if (current.right != null && current.right != lastVisit) {
                stack.push(current);
                current = current.right;
                while (current != null) {
                    stack.push(current);
                    current = current.left;
                }
            }else {
                list.add(current.val);
                lastVisit = current;
            }
        }
        return list;
    }
}