Data Structures :: Searching & Sorting - Discussion

 How will you find the maximum element in a binary search tree?

Case I:
public void max(Tree root)
{
while(root.left() != null) 
{
root = root.left();
}
System.out.println(root.data());
}

Case II:
public void max(Tree root)
{
while(root != null)
{
root = root.left();
}
System.out.println(root.data());
}

Case III:
public void max(Tree root)
{
while(root.right() != null)
{
root = root.right();
}
System.out.println(root.data());
}

Case IV:
public void max(Tree root)
{
while(root != null)
{
root = root.right();
}
System.out.println(root.data());
}