Find the nth Node in Binary Search Tree

Question

Using this bootstrap:

template <class Comparable>
const Comparable& AugmentedBinarySearchTree<Comparable>::NthElement(int n)
{
  int *i = 0;
  return NthElement(root, i, n)->element;
}

How would you find the nth node in a BST using the nodesVisited pointer to keep track of the nodes checked?

template <class Comparable>
BinaryNode<Comparable>* AugmentedBinarySearchTree<Comparable>::
NthElement(BinaryNode<Comparable> *t, int *nodesVisited, int n) const
{

}

Each node in the BST has a pointer left and right and a value of template <class Comparable> called element .

Answer 1

It sounds to me (from your comment) like you're looking for Boost's multi-index container ( http://www.boost.org/doc/libs/1_59_0/libs/multi_index/doc/index.html ). You would have vector and map views, and insert with push_back into the vector view while using the map view to search by key. Then you would use the vector view to get the nth-inserted element.