1. 程式人生 > >Binary Tree Paths

Binary Tree Paths

param leaf == oot ret paths add you logs

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */
public class Solution {
    /**
     * @param root the root of the binary tree
     * 
@return all root-to-leaf paths */ public List<String> binaryTreePaths(TreeNode root) { // Write your code here List<String> paths = new ArrayList<String>(); if (root == null) { return paths; } List<String> leftPaths = binaryTreePaths(root.left); List
<String> rightPaths = binaryTreePaths(root.right); for (String leftPath : leftPaths) { paths.add(root.val + "->" + leftPath); } for (String rightPath : rightPaths) { paths.add(root.val + "->" + rightPath); }
if (paths.size() == 0) { paths.add("" + root.val); } return paths; } }

Binary Tree Paths