Question

Recall that an in-order traversal of a BinarySearch Tree will visit all the nodes in sorted (based on the sorted order of the data). Given the following Node and method definition for a BinarySearch Tree, write a method that returns the Node that follows the Node w in an in-order traversal of the tree, assuming that w.right is nil (n.b., this implies that the Node that follows w must be an ancestor of w, not a descendant). public class Node<T extends Comparable<T>>{ T data; Node left, right, parent; * * * * Find the node that follows w in an in-order traversal. * Assume that w.right == nil * @return the node that follows in an in-order traversal. * public Node findNext(Node w){

Answer 1

Code:

public class Node<T extends Comparable<T>>{
T data;
Node left,right,parent;
}

public InorderTraversal(Node aNode,Node w)
{
if(aNode == null)
return;
  
InorderTraversal(aNode.left,w);

//If the Node is found return the parent as the right child is null as given in the question
if(aNode.data == w.data)
{
return aNode.parent;
}
InorderTraversal(aNode.right,w);
  
//w not found
return null
  
}

public Node findNext(Node w)
{
return InorderTraversal(root,w);
}