data structures & algorithms Practice Questions Answers Test with Solutions & More Shortcuts

Question : 6

The complexity of Binary search algorithm is

a) O(n)

b) O(log )

c) O(n log n)

d) None of the above

Question : 7

The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal

a) ABFCDE

b) ADBFEC

c) ABDECF

d) None of the above

Question : 8

The complexity of merge sort algorithm is

a) O(n)

b) O(log n)

c) O(n log n)

d) None of these

Question : 9

The depth of a complete binary tree is given by

a) D _n = n log ₂ n

b) Dn = _n log ₂ n+1

c) D _n = log ₂ n

d) D _n = log ₂ n+1

Question : 10

In a graph if e=(u, v) means

a) e begins at u and ends at v

b) u is processor and v is successor

c) both B and C are true

d) none is true