[leetcode] Binary Tree Paths

https://leetcode.com/problems/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"]

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    private List<TreeNode> path;
    LinkedList<String> paths = new LinkedList<String>();
    
    public List<String> binaryTreePaths(TreeNode root) {
        if(null == root) {
            return paths;
        }
        path = new LinkedList<TreeNode>();
        path.add(root);
        dfs(root);
        return paths;
    }

	private void dfs(TreeNode root) {
		if(null == root.left && null == root.right) {
			String s = build();
			if(null != s) {
				paths.add(s);				
			}
			return;
		}
		
		if(null != root.left) {
			path.add(root.left);
			dfs(root.left);
			path.remove(path.size()-1);
		}

		if(null != root.right) {
			path.add(root.right);
			dfs(root.right);
			path.remove(path.size()-1);
		}
	}

	private String build() {
		if(0 == path.size()) {
			return null;
		}
		StringBuilder sb = new StringBuilder();
		Iterator<TreeNode> it = path.iterator();
		sb.append(it.next().val);
		while(it.hasNext()) {
			sb.append("->").append(it.next().val);
		}
		return sb.toString();
	}
}

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"]