CS301 Solution 3 by Junaid

#include<iostream> #include<stdlib.h> using namespace std; class TreeNode

private: int* obj; TreeNode* left; TreeNode* right; public: TreeNode()

this->obj = NULL; this->left = this->right = NULL;

TreeNode(int* obj)

this->left = this->right = NULL;

PAID ASSIGNMENT SERVICES are AVAIBLE

 CS506  Cs411  CS403  CS504  CS604 int* getInfo()

return this->obj;

void setInfo(int* obj)

TreeNode* getLeft()

return left;

void setLeft(TreeNode* left)

this->left = left;

TreeNode* getRight()

return right;

void setRight(TreeNode* right)

this->right = right;

int isLeaf()

if (this->left == NULL && this->right == NULL) return 1; return 0; bool isFull()

int getSize()

void percolateDown(int hole)

int child; int tmp = array[hole]; for (; hole * 2 <= currentSize; hole = child)

child = hole * 2; if (child != currentSize && array[child + 1] < array[child]) child++; if (array[child] < tmp) array[hole] = array[child]; else break;

array[hole] = tmp;

void buildHeap(int* anArray, int n)

for (int j = 1; j <= n; j++)

array[j] = anArray[j - 1]; currentSize = n;

for (int j = currentSize / 2; j > 0; j--)

percolateDown(j);