# Data Structures and Algorithms Multiple Choice Questions - Set 4

31.       The pre-order traversal of a binary-search tree is DBACFE. What is the post-order traversal?
(A) ABFCDE
(C) ABFEDC
(D) ACBEFD
32.       What could be the worst case height of an AVL tree?
(A) 0.97 log n
(B) 2.13 log n
(C) 1.44 log n
(D) n2 log n
33.       Which amongst the following cannot be a balance factor of any node of an AVL tree?
(A) 1
(B) 0
(C) 2
(D) -1
34.       How many distinct binary search trees can be formed which contains the integers 1, 2, 3?
(A) 6
(B) 5
(C) 4
(D) 3
35.       The sort which inserts each elements A(K) into proper position in the previously sorted sub array A(1), ..., A(K–1)
(A) Insertion sort
(C) Merge sort
(D) Bubble sort
36.       Direct or random access of elements is not possible in ...............
(B) Array
(C) String
(D) None of these
37.       push() and pop() functions are found in ...............
(A) queues
(B) lists
(C) stacks
(D) trees
38.       Shell sort uses ................
(A) insertion sort
(B) merge sort
(C) selection sort
(D) quick sort
39.       Which of the following algorithm cannot be designed without recursion?
(A) Tower of Hanoi
(B) Fibonacci Series
(C) Tree Traversal
(D) None of the above