avltree.h

Static Timing Analyzer

class idAVLTree;
class idAVLTreeNode {
friend class idAVLTree;
private:
    int bf;
    idAVLTreeNode *LeftTree;
    idAVLTreeNode *RightTree;
    Gate *elem;
};


class idAVLTree {
    idAVLTreeNode *Root;

    Boolean Rebalance(idAVLTreeNode *unbal, idAVLTreeNode *unbalp);
      /* TRUE means tree height has been modified */
    Boolean search_delkey(Boolean *result, GateId key, idAVLTreeNode *curr,
                          idAVLTreeNode *currp);
      /* TRUE means tree height has been modified */
    Boolean get_rhead(Gate **moved, idAVLTreeNode *curr, idAVLTreeNode *curp,
                      int dirc);
      /* TRUE means tree height has been modified */
    void deltree(idAVLTreeNode *treeroot);
    void dumptree(idAVLTreeNode *treeroot, int level);
  public:

    idAVLTree();

    /* Find whether an element with key "key" is in the bag. */
    Boolean IsIn(GateId key); 

    /* Find an element with key "key". */
    /* If the element does not exist, return NULL. */
    Gate *Find(GateId key); 

    /* Insert an element */
    Boolean Insert(Gate *elem);

    /* delete an element with key "key". */
    Boolean Delete(GateId key);

    /* delete whole Tree */
    void DeleteTree(void);

    /* dump whole Tree from smaller to bigger */
    void Dump(void);
};