- +44 141 628 6080
- info@tutorsglobe.com

Implement the simplified heap class for integers in c refer

**1. **Implement the Binary Search Tree (BST) in C++, using the Node class template provided below. Please read the provided helper methods in class BST, especially for deleteValue(), make sure you get a fully understanding of the recursive algorithm, by comparing it with Algorithms 3.4.15 and 3.4.16 from page 128 to 130. Are they equivalent?

template

class Node {

public:

T value;

Node *left;

Node *right;

Node(T val) {

value = val;

left = NULL;

right = NULL;

}

Node(T val, Node

value = val;

left = left;

right = right;

}

};

template

class BST {

private:

Node

intheightHelper(Node

if (!root) return 0;

else return 1 + max(heightHelper(root->left), heightHelper(root->right));

}

bool deleteValueHelper(Node

if (!current) return false;

if (current->value == value) {

if (current->left == NULL || current->right == NULL) {

Node

if (current->right) temp = current->right;

if (parent) {

if (parent->left == current) {

parent->left = temp;

} else {

parent->right = temp;

}

} else {

this->root = temp;

}

} else {

Node

while (validSubs->left) {

validSubs = validSubs->left;

}

T temp = current->value;

current->value = validSubs->value;

validSubs->value = temp;

return deleteValueHelper(current, current->right, temp);

}

delete current;

return true;

}

return deleteValueHelper(current, current->left, value) ||

deleteValueHelper(current, current->right, value);

}

public:

void add(T val) {

}

// print items in ascending order

void print() {

}

intnodesCount() {

}

intheight() {

return heightHelper(this->root);

}

bool deleteValue(T value) {

return this->deleteValueHelper(NULL, this->root, value);

}

};

Then test it with the following list of last names in our class:

intmain() {

constsize_tarraySize{17};

array

"Wilmot", "Hoffmann", "Fall", "Kline", "Aparicio",

"Li", "Hess", "Stenseng", "Weiss", "Hood", "Christiansen",

"Dale", "Seward", "Han"};

BST

for(size_ti{0}; i

bst->print();

cout<

cout<

cout<

bst->deleteValue("Tian");

cout<<"Tian removed: ";

bst->print();

cout<

bst->deleteValue("Kline");

cout<<"Kline removed: ";

bst->print();

cout<

return 0;

}

**2. **Implement the simplified Heap class for integers, in C++. Refer to the algorithms in the textbook.

The required methods are:

- Siftdown (algorithm 3.5.7)

- heapify (algorithm 3.5.12)

- print (to print the array of integers)

Test your heap's heapify method,using the following sequence of integers as initial status of the array.Display the before and after status.

42, 58, 11, 33, 81, 65, 32, 19, 24, 57, 13, 47, 66, 41, 95

Now Priced at $25 (50% Discount)

Recommended **(92%)**

18,76,764

Questions

Asked

21,311

Experts

9,67,568

Questions

Answered

Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!

Submit Assignment
## Q : Write a c program that waits for a button connected to pd2

there are several ways to calculate the pulse width of a digital input signal one method is to directly read the input