#ifndef DANS_BTREE_DOT_H
#define DANS_BTREE_DOT_H 1 

#include <string>
#include <iostream>

using namespace std;

struct nodeT {
    string data;
    nodeT * parent,
          * lchild,
	  * rchild;
};

typedef nodeT * node;

class  btreeT {
   public:
       btreeT();
       // transforms v from an external node to an internal node and gives
       // it two children

       void expandExternal(node);

       // returns the rightchild of a node

       node rightChild(node);

       // returns a left child of a node
       node leftChild(node);
       node Root();
       node parent(node);
       bool isInternal(node);
       bool isExternal(node);
       bool isRoot(node);
       int size();
       void swapElements(node, node);
       void replaceElement(node,string);
       string element(node);

   private:
      nodeT * root;
      int count;
};


#endif