-
Notifications
You must be signed in to change notification settings - Fork 7
/
Main.java
37 lines (31 loc) · 898 Bytes
/
Main.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
package com.company;
import java.util.ArrayList;
import java.util.List;
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;
}
}
public class Main {
public static void main(String[] args) {
// write your code here
}
public List<String> binaryTreePaths(TreeNode root) {
List<String> res = new ArrayList<>();
dfs(root, "", res);
return res;
}
public void dfs(TreeNode node, String path, List<String> res){
if(node == null) return;
if(node.left == node.right) res.add(path + node.val);
dfs(node.left, path + node.val + "->", res);
dfs(node.right, path + node.val + "->", res);
}
}