Question: Question 7 (1 point) Consider the AVL tree below. What rotation(s) are needed to balance the tree. A single left rotation on 2. A double



Question 7 (1 point) Consider the AVL tree below. What rotation(s) are needed to balance the tree. A single left rotation on 2. A double rotation: a left rotation on 2 followed by a left rotation on 4. A single rotation left rotation on 3. A double rotation: a right rotation on 3 followed by a left rotation on 2 Question 8 (1 point) A Binary Search Tree is always Balanced True False Question 9 (1 point) Select all True statements (Negative points for incorrect selection) The time complexity of Dijkstra's algorithm is O((V + E) log V) if binary heap is used. The Dijkstra's algorithm find the minimum spanning tree in a graph In Dijkstra's algorithm the node with minimum distance from the source is selected from the remaining nodes in the unvisited and the distance of its adjacent nodes are updated. Dijkstra's Algorithm produces correct results if graph has negative edge weight
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
