给定一个二叉树,返回所有从根节点到叶子节点的路径。
说明:叶子节点是指没有子节点的节点。
示例:
输入:
1
/ \
2 3
\
5
输出: ["1->2->5", "1->3"]
解释: 所有根节点到叶子节点的路径为: 1->2->5, 1->3
package com.loo;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
public class BinaryTreePaths {
public static void main(String[] args) {
TreeNode root = new TreeNode(1);
TreeNode left = new TreeNode(2);
TreeNode right = new TreeNode(3);
TreeNode left2 = new TreeNode(5);
root.left = left;
root.right = right;
left.right = left2;
List<String> paths = getBinaryTreePaths(root);
System.out.println(paths);
System.out.println(getBinaryTreePaths2(root));
}
// 深度优先
public static List<String> getBinaryTreePaths(TreeNode root) {
List<String> paths = new ArrayList<String>();
treePaths(root , "" , paths);
return paths;
}
public static void treePaths(TreeNode root , String path , List<String> paths) {
if (root!=null) {
StringBuffer pathBuff = new StringBuffer(path);
pathBuff.append(Integer.toString(root.value));
if (root.left == null && root.right == null) {
paths.add(pathBuff.toString());
} else {
pathBuff.append("-->");
treePaths(root.left , pathBuff.toString() , paths);
treePaths(root.right , pathBuff.toString() , paths);
}
}
}
// 广度优先
public static List<String> getBinaryTreePaths2(TreeNode root) {
List<String> paths = new ArrayList<String>();
if (root == null) {
return paths;
}
Queue<TreeNode> nodeQueue = new LinkedList<TreeNode>();
Queue<String> pathQueue = new LinkedList<String>();
nodeQueue.offer(root);
pathQueue.offer(Integer.toString(root.value));
while (!nodeQueue.isEmpty()) {
TreeNode node = nodeQueue.poll();
String path = pathQueue.poll();
if (node.left==null && node.right==null) {
paths.add(path);
} else {
if (node.left!=null) {
nodeQueue.offer(node.left);
pathQueue.offer(new StringBuffer(path).append("-->").append(node.left.value).toString());
}
if (node.right!=null) {
nodeQueue.offer(node.right);
pathQueue.offer(new StringBuffer(path).append("-->").append(node.right.value).toString());
}
}
}
return paths;
}
static class TreeNode {
int value;
TreeNode left;
TreeNode right;
TreeNode(int v) {
value = v;
}
}
}