Use the definition and the code for the heap developed in class and add the member function int heapRemove ()to the Heap class. The heapRemove() returns the value of the root and readjust the heap to maintain the heap property. [Hint: heapRemove() uses percolate down function] #include
#include
using namespace std;
// The Node class for the Binary Search Tree
template
class Node
{
public:
Node();
Node(T e, Node* r, Node* l);
T element; // holds the node element
Node* right;
Node* left;
};
// implementation of the constrcutors of the Node
template
Node::Node() { right = left = NULL; }
template
Node::Node(T e, Node* r, Node* l) { element = e; right = r; left = l; }
// Binart Searct Tree (BST) class
template
class BTree
{
public:
BTree() { root = NULL; }
BTree(Node* rt) { root = rt; }
void BSTInsert(T value);
void BSTRemove(T value);
Node*& getRoot() { return root; } // returns the pointer to the root
Node* BSTsearch(T value);
private:
Node* root; // a pointer to the root of the tree
};

Think about the poem "old ironsides." drag the subject of the poem to the subject box and the theme to the theme box. then decide whether each excerpt from the poem supports the subject or the theme.

We as humans write math expression in infix notation, e. g. 5 + 2 (the operators are written in-between the operands). in a computer’s language, however, it is preferred to have the operators on the right side of the operands, i. e. 5 2 +. for more complex expressions that include parenthesis and multiple operators, a compiler has to convert the expression into postfix first and then evaluate the resulting postfix. write a program that takes an “infix” expression as input, uses stacks to convert it into postfix expression, and finally evaluates it. it must support the following operations: + - / * ^ % (example infix expression: (7 - 3) / (2 + 2)postfix expression: 7 3 - 2 2 + /result: 1guidelines: 1. you will need to use stacks in three placesa. one for the parenthesis check [char stack]b. one during infix to postfix [char stack]c. one during evaluation [int stack]for a and b above, you can use same array and same push, pop method as both ofthem are char. but for evaluation you have int stack and you might consider to createanother push pop method to handle it. maybe push_int, pop_int, etc. or find otherstrategy to utilize existing push pop method2. you can create a function for obtaining operator priority. that function should take anoperator as input and return its priority as an integer. this function will you a lot andreduce repeated code3. during evaluation you will need to convert char into integer. example for single digit: char c = '5'; int x = c - '0';

What machine listens for http requests to come in to a website’s domain? a. a router b. a browser c. a server d. a uniform resource locator