6.11 二叉树的所有路径——【LeetCode】

package com.tree.java;

import java.util.ArrayList;
import java.util.List;

public class seven {
	//递归法
	public List<String> binaryTreePaths(TreeNode root) {
		 List<String> res = new ArrayList<>();
		 if(root == null) {
			 return res;
		 }
		 List<Integer> paths = new ArrayList<>();
		 traversal(root, paths, res);
		 return res;
	}

	private void traversal(TreeNode root, List<Integer> paths, List<String> res) {
		paths.add(root.val);//每次调用traversal就会调用一次这个添加操作
        // 叶子结点
        if (root.left == null && root.right == null) {
            // 输出
        	//一旦到达叶子结点，说明该路径已经生成，然后将这条路径添加到res中并返回空，返回结果也许是作为①处在某一次的递归执行结束，然后执行下面的remove操作
            StringBuilder sb = new StringBuilder();
            for (int i = 0; i < paths.size() - 1; i++) {
                sb.append(paths.get(i)).append("->");
            }
            sb.append(paths.get(paths.size() - 1));
            res.add(sb.toString());
            return;
        }
        if (root.left != null) {
            traversal(root.left, paths, res);//①处
            paths.remove(paths.size() - 1);// 回溯
        }
        if (root.right != null) {
            traversal(root.right, paths, res);
            paths.remove(paths.size() - 1);// 回溯
        }
	}
}

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;
	}
}