Chapter 17, Problem 10RE

Explanation of Solution

Algorithm:

The algorithm for finding the k element in the sorted order of a binary search tree:

public boolean findK_ele(Object k)

{

//initialize the value of temp equal to root node

Node temp=root;

//while loop

while(temp!=null)

{

//if condition to check whether the value is equal to value at temp

if(temp->data.equals(k))

  return true;

else

//if condition to check whether the value of temp is greater than value of k

if(temp-> data>k)

  temp=templeft;

else

  temp=tempright;

}