// This file is part of RAVL, Recognition And Vision Library 
// Copyright (C) 2001, University of Surrey
// This code may be redistributed under the terms of the GNU Lesser
// General Public License (LGPL). See the lgpl.licence file for details or
// see http://www.gnu.org/copyleft/lesser.html
// file-header-ends-here
//! rcsid="$Id: exAVLTree.cc,v 1.3 2002/07/07 21:42:11 craftit Exp $"
//! lib=RavlCore
//! file="Ravl/Core/Container/Trees/exAVLTree.cc"

#include "Ravl/AVLTree.hh"
#include "Ravl/BinaryTreeUpIter.hh"
#include "Ravl/BinaryTreeDownIter.hh"
#include "Ravl/Stream.hh"

using namespace RavlN;

int main() {
  
  AVLTreeC<int,char *> tree(true);

  // Put some data into the tree.
  
  tree.Insert(4,"c");
  tree.Insert(2,"a");
  tree.Insert(3,"b");
  
  // Go through the tree from the smallest to largest
  // key values.
  
  cout << "Up....\n";
  for(BinaryTreeUpIterC<int,char *> it(tree);it;it++) 
    cout << "Key=" << it.Key() <<" Data=" << it.Data() << "\n";

  // Go through the tree from the largest to smallest 
  // key values.
  
  cout << "Down....\n";  
  for(BinaryTreeDownIterC<int,char *> it(tree);it;it++) 
    cout << "Key=" << it.Key() <<" Data=" << it.Data() << "\n";

  return 0;
}