... Faculty of Computer Science and Engineering Department of Computer Science 1/ 3 DATA STRUCTURES & ALGORITHMS Tutorial 4 Questions AVL Tree and Heap Part 1. AVL Tree ... merge the contents of two binary search trees into one. What is the running time of your algorithm? Faculty of Computer Science and Engineering Department of Computer Science 2/3 ... c) 3, 1, 4, 1, 5, 9, 2, 6, 5, 4 d) 2, 7, 1, 8, 2, 8, 1, 8, 2 e) 45, 9, 2, 17 , 84, 92, 71, 18 , 30, 62, 55, 20, 27 Question 8. Show the heap (tree) you will have after removing (from 1- 3 times)...