---

algorithms/BinTree.h

Go to the documentation of this file.

/***************************************************************************
                          BinTree.h  -  description
                             -------------------
    begin                : Fri Jan 17 2003
    copyright            : (C) 2003 by LEA / TUM
    email                : taeubig@in.tum.de
 ***************************************************************************/

#ifndef BINTREE_H
#define BINTREE_H

#include <LEDA/list.h>


typedef struct knot {
  double val;
  bool leaf;
  knot* child1;
  knot* child2;
  leda_list_item content;
} knot;


class BinTree {
public: 
  BinTree(leda_list_item li, double val);
  ~BinTree();

  BinTree* join(BinTree bt);
  knot* getRoot();
  

private:
  knot* root;
  
};

#endif

---