257. Binary Tree Paths

Given a binary tree, return all root-to-leaf paths.

For example, given the following binary tree:

   1
 /   \
2     3
 \
  5

All root-to-leaf paths are:

["1->2->5", "1->3"]

題意:

將一顆二叉樹的所有路徑打印出來

題解:

對這個二叉樹遞歸地進行左右子樹的歷遍，並記錄它們的路徑

package LeetCode.Easy;

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

import LeetCode.Dependencies.TreeNode;

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class BinaryTreePaths {
    List<String> answer = new ArrayList<String>();
    public List<String> binaryTreePaths(TreeNode root) {
       
        if(root == null)
            return answer;
        
        //拜訪root節點
        findBinaryTreePaths(root, String.valueOf(root.val));

        return answer;
    }
    
    public void findBinaryTreePaths(TreeNode root, String path) {
        //若該節點的兩邊都沒有子節點時則表示到最終葉子節點了，則放入答案
        if(root.left == null && root.right == null)
            answer.add(path);
        //拜訪左邊
        if(root.left != null)
            findBinaryTreePaths(root.left, path + "->" + root.left.val);
        
        //拜訪右邊
        if(root.right != null)
            findBinaryTreePaths(root.right, path + "->" + root.right.val);
        
    }
}