|
8 | 8 | * } |
9 | 9 | */ |
10 | 10 | classSolution { |
11 | | -publicList<Integer>distanceK(TreeNoderoot,TreeNodetarget,intk) { |
12 | | -List<Integer>result =newArrayList<>(); |
13 | | -dfs(root,target,k,result); |
14 | | -returnnewArrayList<>(result); |
15 | | - } |
16 | | - |
17 | | -privateintdfs(TreeNodenode,TreeNodetarget,intk,List<Integer>result) { |
18 | | -if (node ==null) { |
19 | | -return -1; |
| 11 | +publicList<Integer>distanceK(TreeNoderoot,TreeNodetarget,intk) { |
| 12 | +List<Integer>result =newArrayList<>(); |
| 13 | +dfs(root,target,k,result); |
| 14 | +returnresult; |
20 | 15 | } |
21 | | -if (node ==target) { |
22 | | -addToResult(node,0,result,k); |
23 | | -return1; |
24 | | - }else { |
25 | | -intleft =dfs(node.left,target,k,result); |
26 | | -intright =dfs(node.right,target,k,result); |
27 | | -if (left != -1) { |
28 | | -if (left ==k) { |
29 | | -result.add(node.val); |
| 16 | + |
| 17 | +privateintdfs(TreeNodenode,TreeNodetarget,intk,List<Integer>result) { |
| 18 | +if (node ==null) { |
| 19 | +return -1; |
30 | 20 | } |
31 | | -addToResult(node.right,left +1,result,k); |
32 | | -returnleft +1; |
33 | | - }elseif (right != -1) { |
34 | | -if (right ==k) { |
35 | | -result.add(node.val); |
| 21 | +if (node ==target) { |
| 22 | +dfs(node,0,k,result); |
| 23 | +return1; |
| 24 | + } |
| 25 | +intleft =dfs(node.left,target,k,result); |
| 26 | +if (left != -1) { |
| 27 | +if (left ==k) { |
| 28 | +result.add(node.val); |
| 29 | + } |
| 30 | +dfs(node.right,left +1,k,result); |
| 31 | +returnleft +1; |
| 32 | + } |
| 33 | +intright =dfs(node.right,target,k,result); |
| 34 | +if (right != -1) { |
| 35 | +if (right ==k) { |
| 36 | +result.add(node.val); |
| 37 | + } |
| 38 | +dfs(node.left,right +1,k,result); |
| 39 | +returnright +1; |
36 | 40 | } |
37 | | -addToResult(node.left,right +1,result,k); |
38 | | -returnright +1; |
39 | | - }else { |
40 | 41 | return -1; |
41 | | - } |
42 | | - } |
43 | | - } |
44 | | - |
45 | | -privatevoidaddToResult(TreeNodenode,intdist,List<Integer>result,intk) { |
46 | | -if (node ==null ||dist >k) { |
47 | | -return; |
48 | 42 | } |
49 | | -if (dist ==k) { |
50 | | -result.add(node.val); |
51 | | - }else { |
52 | | -addToResult(node.left,dist +1,result,k); |
53 | | -addToResult(node.right,dist +1,result,k); |
| 43 | + |
| 44 | +privatevoiddfs(TreeNodenode,intdistance,intk,List<Integer>result) { |
| 45 | +if (node ==null ||distance >k) { |
| 46 | +return; |
| 47 | + } |
| 48 | +if (distance ==k) { |
| 49 | +result.add(node.val); |
| 50 | +return; |
| 51 | + } |
| 52 | +dfs(node.left,distance +1,k,result); |
| 53 | +dfs(node.right,distance +1,k,result); |
54 | 54 | } |
55 | | - } |
56 | 55 | } |