257. 二叉树的所有路径

 

/**
 * 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<>();
    public List<String> binaryTreePaths(TreeNode root) {
        sub_process(root,"");
        return res;
        
    }

    public void sub_process(TreeNode node,String s){
        if(node==null){
            return;
        }
        if(node.left==null && node.right==null){
            res.add(new StringBuilder(s).append(node.val).toString());
            return;
        }
        //tmp要为String类型
        String tmp = new StringBuilder(s).append(node.val).append("->").toString();
        sub_process(node.left,tmp);
        sub_process(node.right,tmp);
    }
}

class Solution {
    public List<String> binaryTreePaths(TreeNode root) {
        List<String> res = new ArrayList<>();
        if (root==null){
            return res;
        }
        Stack<Object> stack = new Stack<>();
        stack.push(root);
        stack.push(root.val+"");
        while(!stack.isEmpty()){
            //记录一条路径
            String path = (String) stack.pop();
            TreeNode node = (TreeNode) stack.pop();

            //若到叶子节点
            if(node.left==null && node.right==null){
                res.add(path);
            }

            //若右子节点不空
            if(node.right != null){
                stack.push(node.right);
                stack.push(path+"->"+node.right.val);
            }

            //若左子节点不空
            if(node.left != null){
                stack.push(node.left);
                stack.push(path+"->"+node.left.val);
            }
        }
        return res;   
    }
}