5.30 Tree Traversal + Tree manipulation

• 1. Binary Tree Preorder Traversal

题目：对一棵二叉树进行前序遍历，并将结果存在一个List

public class Solution {
    public ArrayList<Integer> preorderTraversal(TreeNode root) {
        ArrayList<Integer> result = new ArrayList<Integer>();
        // null or leaf
        if (root == null) {
            return result;
        }

        // Divide
        ArrayList<Integer> left = preorderTraversal(root.left);
        ArrayList<Integer> right = preorderTraversal(root.right);

        // Conquer
        result.add(root.val);
        result.addAll(left);
        result.addAll(right);
        return result;
    }
}

5.30 Tree Traversal + Tree manipulation

原文：https://www.cnblogs.com/kong-xy/p/9114651.html