/* Class derived from the base class BST:

   Include "return k'th entry" behavior.  Nothing else added or altered.
   NOTE:  zero-based; i.e., smallest entry is the zeroeth entry
*/

#ifndef BST_K_H
#define BST_K_H

// Extra-credit options.  If doing one of the extra credit options,
// REMOVE the comment marker "//" from the appropriate line.

//#define OPT_1      // BasePtr Entry_k  --- traversal based
//#define OPT_2      // BasePtr Entry_k  --- size based
//if neither defined // void    Entry_k  --- full traversal

#include "BST.h"

class BST_k : public BST
{
   public:                   // You may not change the public portion
      BasePtr Entry_k ( int k );

   protected:                // You can do anything you want below this

// HERE IS WHERE YOU PUT THE PROTOTYPE FOR YOUR IMPLEMENTATION FUNCTION

};

#endif