#include "BinarySearchTree.h"
#include <stdio.h>

main() {
  //Insert some arbitrary values.
  insert(2);
  insert(5);
  insert(1);
  insert(4);
  insert(3);
  insert(3);
  insert(8);
  insert(12);
  insert(0);
  insert(7);

  //Testing min and max
  printf("min:%d\n", min()->key);
  printf("max:%d\n", max()->key);


  //Remove some values.
  remove(5);
  remove(98);
  remove(7);

  //Testing search.
  printf("Searching for 8:%d\n", search(8)->key);

  //Testing traversal.
  beforeFirst();
  while(hasNext()) {
    printf("%d ", next()->key);
  }
  
  printf("\n");

}