Tag: Data Structures and Algorithms Mcq

(A) A binary tree of N external nodes has N internal node
(B) A binary tree of N internal nodes has N+ 1 external node
(C) A binary tree of N external nodes has N+ 1 internal node
(D) A binary tree of N internal nodes has N- 1 external node

(A) O(1) time because all lists take the same amount of time to sort
(B) O(n) time because it has to perform n swaps to order the list
(C) O(n2) time because sorting 1 element takes O(n) time – After 1 pass through the list, either of these algorithms can guarantee that 1 element is sorted
(D) O(n3) time, because the worst case has really random input which takes longer to sort

(A) Each list Si contains the special keys + infinity and – infinity
(B) List S0 contains the keys of S in non-decreasing order
(C) Each list is a subsequence of the previous one
(D) List Sh contains only the n special keys

(A) Sorted
(B) Unsorted
(C) Heterogeneous
(D) Random

(A) 21
(B) 22
(C) 23
(D) 24

(A) 54
(B) 55
(C) 56
(D) 57

(A) Binary Tree
(B) Complete Binary Tree
(C) Binary Search Tree
(D) None of the above

(A) Stack
(B) Queue
(C) Binary search tree
(D) AVL tree