二叉树遍历

经典的问题为前序、中序、后序遍历的代码实现。

用递归函数实现比较简单，而用循环的方式实现则比较有挑战性，特别是后序遍历的循环实现。在这类问题下，需要将一些节点存储起来，并且后续会需要优先访问最近存入的节点，就可以用到“栈”这个数据结构。具体参见下面第一个代码块的代码实现。

推而广之，还有层序遍历等一系列题目。参见二叉树的层序遍历

import java.util.*;
 
/*
 * public class TreeNode {
 *   int val = 0;
 *   TreeNode left = null;
 *   TreeNode right = null;
 * }
 */
 
public class Solution {
    /**
     *
     * @param root TreeNode类 the root of binary tree
     * @return int整型二维数组
     */
    public int[][] threeOrders (TreeNode root) {
        List<Integer> recordArray = new ArrayList<>();
        TreeNode node = root;
 
        Stack<TreeNode> candidateStack = new Stack<>();
        while(node != null || !candidateStack.isEmpty()) {
            while(node != null) {
                recordArray.add(node.val);
 
                if (node.right != null) {
                    candidateStack.push(node.right);
                }
 
                node = node.left;
            }
 
            if(!candidateStack.isEmpty()) {
                node = candidateStack.pop();
            }
        }
 
        int[][] ret = new int[3][recordArray.size()];
        fillArray(ret, recordArray, 0);
 
        node = root;
        recordArray.clear();
        while(node != null || !candidateStack.isEmpty()) {
            while (node != null) {
                candidateStack.push(node);
                node = node.left;
            }
 
            if (!candidateStack.isEmpty()) {
                node = candidateStack.pop();
                recordArray.add(node.val);
                node = node.right;
            }
        }
        fillArray(ret, recordArray, 1);
 
        node = root;
        TreeNode lastRecordNode = null;
        recordArray.clear();
        while (node != null || !candidateStack.isEmpty()) {
            while (node != null) {
                candidateStack.push(node);
                node = node.left;
            }
 
            node = candidateStack.peek();
            if (node.right == null || node.right == lastRecordNode) {
                recordArray.add(node.val);
                lastRecordNode = node;
                candidateStack.pop();
                node = null;
            } else {
                node = node.right;
            }
        }
        fillArray(ret, recordArray, 2);
 
        return ret;
    }
     
    private void fillArray(int[][] ret, List<Integer> recordArray, int targetRow) {
        for (int i = 0; i < recordArray.size(); i++) {
            ret[targetRow][i] = recordArray.get(i);
        }
    }
}