template <class Comparable>
BinaryNode<Comparable>* BinarySearchTree<Comparable>::findKth(Comparable value,Node*t)
{
  bool found = false;
  int value1 = value;
  Node* t1 = t;
  if (t == NULL)
    {return false;}
  int leftSize = treeSize(t1->left);
  while (found == false && leftSize < treeSize(root))
    {
      leftSize = treeSize(t1->left);
      if(value1 <= leftSize)
	{ t1 = t1->left;}
      else if (value1 == leftSize+1)
	{ return t1;}
      else
	{ value1 = value1-leftSize-1;
	  t1 = t1->right;}
    }
  return t1;