(TreeNode root, int B,ArrayList<Integer> list)
| 6 | return list; |
| 7 | } |
| 8 | public static boolean travel(TreeNode root, int B,ArrayList<Integer> list) |
| 9 | { |
| 10 | if(root==null) return false; |
| 11 | |
| 12 | list.add(root.val); |
| 13 | |
| 14 | if(root.val==B) return true; |
| 15 | |
| 16 | if(travel(root.left,B,list) || travel(root.right,B,list)) |
| 17 | return true; |
| 18 | list.remove(list.size()-1); |
| 19 | return false; |
| 20 | } |
| 21 | } |