Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int FindParent(Node root, int x){
- if (root == null || root.value == x) return null;
- ArrayDeque<Node> queue = new ArrayDeque();
- queue.offer(root);
- while(!queue.isEmpty()){
- Node n = (Node) queue.poll();
- if (n.left != null){
- if (n.left.value == x) return n.value;
- queue.offer(n.left);
- }
- if (n.right != null){
- if (n.right.value == x) return n.value;
- queue.offer(n.right);
- }
- }
- return null;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement