myVector.h

Go to the documentation of this file.

#pragma once

#if !defined(vektor_INCLUDED)
#define vektor_INCLUDED

#include <iostream>

#if !defined(myMAx_INCLUDED)
#define myMax_INCLUDED
#include "myMaxheap.h"
#endif
#if !defined(myDpair_INCLUDED)
#define myDpair_INCLUDED
#include "myDpair.h"
#endif
#if !defined(myElem_INCLUDED)
#define myElem_INCLUDED
#include "myElement.h"
#endif

class myVector
{
private:
    myElement    *root;             
    myElement    *leaf;             
    myMaxheap    *heap;             
    int      support;               

    void        rotateLeft(myElement *x);                       
    void        rotateRight(myElement *y);                      
    void        insertCleanup(myElement *z);                    
    void        deleteCleanup(myElement *x);                    
    myDpair *returnSubtreeAsList(myElement *z, myDpair *head);  
    void        printSubTree(myElement *z);                     
    void        deleteSubTree(myElement *z);                    
    myElement   *returnMinKey(myElement *z);                    
    myElement   *returnSuccessor(myElement *z);                 
public:
    myVector(int size); 
    ~myVector(void);                            // default constructor/destructor

    myElement*  findItem(const int searchKey);                  
                                                    // returns T if searchKey found, and
                                                    // points foundNode at the corresponding node
    void        insertItem(int newKey, double newStored);       
    void        deleteItem(int killKey);                        
    void        deleteTree();                                   
    myDpair *returnTreeAsList();                                
    myDpair *returnTreeAsList2();                               
    mytuple returnMaxKey();                                     
    mytuple returnMaxStored();                                  
    int     returnNodecount();                                  

    void        printTree();                                    
    void        printHeap();                                    
    int     returnArraysize();                                  
    int     returnHeaplimit();                                  
};

#endif