(c) Below is a Complete Binary Tree that represents the weight between vertices in the above graph. Answer the below que

[answerhappygod]

C Below Is A Complete Binary Tree That Represents The Weight Between Vertices In The Above Graph Answer The Below Que 1 (102.54 KiB) Viewed 14 times

(c) Below is a Complete Binary Tree that represents the weight between vertices in the above graph. Answer the below questions based on your Group Type: 10 45 6 10 60 22 29 9 24 11 15 30 17 18 2 25 • For Even Group of 2021-22 batch students: - In the process of building a Max-Heap Tree, the first swap is between and (write down the numbers). [2 marks] - And the second swap is between and (write down the numbers). [2 marks] - Draw a tree that shows the final result (intermediate work is not required). [6 marks] • For Odd Group of 2021-22 batch students: - In the process of building a Min-Heap Tree, the first swap is between __ and (write down the numbers). [2 marks] - And the second swap is between and (write down the numbers). [2 marks] - Draw a tree that shows the final result (intermediate work is not required). [6 marks] • For 2020-21 batch students (special paper): - List the elements of the tree in ascending order. [2 marks] - Draw a binary search tree for the same values, removing duplicates if any. You need to make your tree as balanced as possible. If it is not balanced, mention all the nodes where the AVL tree condition is violated. [8 marks]