part 1:

part 2: Actually part 1 has answer. No need to answer that part.

. Draw the binary search tree (BST) that results from inserting the values 1 to 7 in each of the following orders (reading from left to right): 1 2 3 4 5 6 7 . . 53 76 214 . 435 2617 Then draw AVL tree of each BST that order on above rows, by inserting two nodes 10, 20. By using the last configuration of A, B and C tree, draw a Heap tree, then remove the smallest node and redraw the Heap tree. Write an algorithm that takes as input an array, and returns the array with all the duplicate elements removed. For example, if the input array is {1, 3, 3, 2, 4, 2, 5, 5}, the algorithm returns (1, 3, 2, 4, 5). Write the list of vertices that visited by running a breadth-first search (BFS) and a depth-first search (DFS) starting from Enode. 3 5 Run Dijkstra's algorithm on the weighted graph below, using vertex A as the source. Write the vertices in the order which they are marked. Run Prim's algorithm on the weighted graph below, using vertex A as the source. What is the sum of the weights of the first, the third, and the fifth edges that are added to the output of Prim's algorithm? 11 3 13 E F ( NAZ NMA Draw the Binary Search Tree (BST) after inserting the following sequence of elements. Assume that smaller elements are on the left. 6,4,8,1,12,3,19,5,20 Write a recursive method static int size OfTreeNode root) that counts the number of nodes in a binary tree with the given root node. Do not use external fields to store intermediate results. For this question, assume you have a Node class that has the basic methods implemented:getLeft(), getRight(), setLeft(), setRight()... Draw the final result after inserting keys 5, 19, 28, 15, 20, 17, 10, 33 into a hash table with collisions resolved by (a) chaining, (b) linear probing. Let the table have eight slots with addresses starting at 0, and let the hash function be h(k) = k mod 8. Implement a linear-time algorithm that given a binary search tree it transforms it into a reverse binary search tree