... Faculty of Computer Science and Engineering Department of Computer Science 2/3 Question 6. Suggest a data structure that supports the following operation and given time complexities: ... Node { E data; Node left, right; } Node root; } Faculty of Computer Science and Engineering Department of Computer Science 3/3 Write a recursive method called isCompleteBinaryTree() ... 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) the root element of...