Inorder Iterator Initialization

template < class N >
void BinaryTreeInorderIterator<N>::Initialize (const N& n)
{
  // enter tree at root
  nav_ = n;
  // slide to leftmost node
  while (nav_.HasLeftChild())
    ++nav_;
}