|
| 1 | +/** |
| 2 | + * Definition for a binary tree node. |
| 3 | + * public class TreeNode { |
| 4 | + * int val; |
| 5 | + * TreeNode left; |
| 6 | + * TreeNode right; |
| 7 | + * TreeNode() {} |
| 8 | + * TreeNode(int val) { this.val = val; } |
| 9 | + * TreeNode(int val, TreeNode left, TreeNode right) { |
| 10 | + * this.val = val; |
| 11 | + * this.left = left; |
| 12 | + * this.right = right; |
| 13 | + * } |
| 14 | + * } |
| 15 | + */ |
| 16 | +classSolution { |
| 17 | +publicTreeNodecorrectBinaryTree(TreeNoderoot) { |
| 18 | +Queue<Pair>queue =newLinkedList<>(); |
| 19 | +queue.add(newPair(root,null)); |
| 20 | +while (!queue.isEmpty()) { |
| 21 | +intsize =queue.size(); |
| 22 | +Set<TreeNode>visited =newHashSet<>(); |
| 23 | +for (inti =0;i <size;i++) { |
| 24 | +Pairpair =queue.remove(); |
| 25 | +TreeNodenode =pair.node(); |
| 26 | +TreeNodeparent =pair.parent(); |
| 27 | +if (visited.contains(node.right)) { |
| 28 | +if (parent.left ==node) { |
| 29 | +parent.left =null; |
| 30 | + }else { |
| 31 | +parent.right =null; |
| 32 | + } |
| 33 | +returnroot; |
| 34 | + } |
| 35 | +visited.add(node); |
| 36 | +if (node.right !=null) { |
| 37 | +queue.add(newPair(node.right,node)); |
| 38 | + } |
| 39 | +if (node.left !=null) { |
| 40 | +queue.add(newPair(node.left,node)); |
| 41 | + } |
| 42 | + } |
| 43 | + } |
| 44 | +returnroot; |
| 45 | + } |
| 46 | + |
| 47 | +privatestaticrecordPair(TreeNodenode,TreeNodeparent) {} |
| 48 | +} |