【DFS】深度优先遍历

深度优先遍历（DFS）也称为回溯，其特点是不停地做选择，直到找到满足条件的集合。
129. 求根节点到叶节点数字之和点击跳转

/**
 * Definition for a binary tree node.
 * 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 Solution {
    public int sumNumbers(TreeNode root) {
        if (root == null) {
            return 0;
        }
        List<String> nodeArr = new ArrayList<>();
        StringBuilder strBuilder = new StringBuilder();
        BackTrace(root, strBuilder, nodeArr);
        int res = 0;
        for (String str : nodeArr) {
            res += Integer.parseInt(str);
        }

        return res;
    }

    public void BackTrace(TreeNode node, StringBuilder str, List<String> nodeArr)
    {
        if (node == null) {
            return;
        }
        str.append(node.val);
        if (node.left == null && node.right == null) { // 找到叶子节点
            nodeArr.add(str.toString());
            return;
        }
        if (node.left != null) {
            BackTrace(node.left, str, nodeArr);
            str.deleteCharAt(str.length() - 1); // 回溯，去除上一次的选择
        }
        if (node.right != null) {
            BackTrace(node.right, str, nodeArr);
            str.deleteCharAt(str.length() - 1);  // 回溯，去除上一次的选择
        }
    }
}