Blog

The following numbers are inserted into an empty binary sear…

The following numbers are inserted into an empty binary search tree (BST) in the given order:  7, 18, 4, 3, 6, 8, 22, 13, 11, 28   a. After each insertion, how many times does the resulting tree become a full binary tree? [full] b Left to right Level order traversal of the BST after all the items inserted in the above order [insertion] c. The number of internal (non-leaf) nodes in this tree created in Step b. [internal] d. Left to right Level order traversal of the BST after deleting node 4 in this tree created in Step b with prioritisation of  inorder predecessor replacement for the two child case  [deletion]   Note: Please separate your answer with one whitespace, e.g. 1 2 3 4 …. and any valid replacement for deletion is acceptable.

Here is some code given to you: #include #include #include u…

Here is some code given to you: #include #include #include using namespace std;int main() {   vector nums = {5, 15, 1 ,-3};    priority_queue left;     priority_queue right;     int foo = 0;    for (int num : nums)     {        if (left.empty() || num right.size() + 1)         {            right.push(left.top());            left.pop();        } else if (right.size() > left.size())         {            left.push(right.top());            right.pop();        }        if (left.size() == right.size())             foo += (left.top() + right.top()) / 2.0;        else            foo += left.top();    }    cout