Anyone can help with writing recursive function that determines the level in the BST?

[Rooro]

Hello everyone :)


I want to learn how can I do this :

write a recursive function member level() for class template BST that determines the level in the BST at which a specified item is located .The root of the BST is at level 0 , its children are at level 1 , and so on

and this is the code for //--- Definition of search()

template <typename DataType>
bool BST<DataType>::search(const DataType & item) const
{
  BST<DataType>::BinNodePointer locptr = myRoot;
  bool found = false;
  for (;;)
  {
    if (found || locptr == 0) break;
    if (item < locptr->data)       // descend left
      locptr = locptr->left;
    else if (locptr->data < item)  // descend right
      locptr = locptr->right;
    else                           // item found
      found = true;
  }
  return found;
}