leetcode257. 二叉树的所有路径

题目描述

给你一个二叉树的根节点 root ，按 任意顺序 ，返回所有从根节点到叶子节点的路径。

叶子节点 是指没有子节点的节点。

题解

/**
 * 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 {
    List<String> res = new ArrayList<>();
    List<Integer> tmp = new ArrayList<>();
    
    public List<String> binaryTreePaths(TreeNode root) {
        backtracking(root);
        return res;
    }
    public void backtracking(TreeNode node) {
        if(node == null) {
            return;
        }
        tmp.add(node.val);
        if(node.left == null && node.right == null) {
            StringBuilder sb = new StringBuilder();
            for(int i = 0; i < tmp.size(); i++) {
                int num = tmp.get(i);
                if(i == 0) {
                    sb.append(num);
                } else {
                    sb.append("->").append(num);
                }
            }
            res.add(sb.toString());
        }
        backtracking(node.left);
        backtracking(node.right);
        tmp.remove(tmp.size() - 1);
    }
}