... Faculty of Computer Science and Engineering Department of Computer Science Question Suggest a data structure that supports the following operation and given time complexities: ... class Node { E data; Node left, right; } Node root; } 2/3 Faculty of Computer Science and Engineering Department of Computer Science Write a recursive method called isCompleteBinaryTree() that ... 8, e) 45 , 9, 2, 17, 84, 92, 71, 18, 30, 62, 55, 20, 27 Question Show the heap (tree) you will have after removing (from 1-3 times) the root element of the tree generated in the all cases of the...