B-tree and AVL tree have the same worst case time complexity for insertion and deletion.

The worst case time complexity of insertion sort is O(n2). What will be the worst case time complexity of insertion sort if the correct position for inserting element is calculated using binary search?

A

O(nlogn)

B

O(n2)

C

O(n)

D

O(logn)

Given an empty AVL tree, how would you construct AVL tree when a set of numbers are given without performing any rotations?

A

just build the tree with the given input

B

find the median of the set of elements given, make it as root and construct the tree

C

use trial and error

D

use dynamic programming to build the tree

The worst case time complexity of tree sort remains unaffected when implemented with an unbalanced tree or a balanced tree.

A

True

B

False

What is the worst case time complexity of the insertion in the hash tree?

A

O(logk(n))

B

O(n2)

C

O(nlogk(n))

D

O(kn)

Worst case is the worst case time complexity of Prim’s algorithm if adjacency matrix is used?

A

O(log V)

B

O(V2)

C

O(E2)

D

O(V log E)

There is a tree between houses of A and B. If the tree leans on A’s House, the tree top rests on his window which is 12 m from ground. If the tree leans on B’s House, the tree top rests on his window which is 9 m from ground. If the height of the tree is 15 m, what is distance between A’s and B’s house?

A

21 m

B

25 m

C

16 m

D

12 m

What is the worst case time complexity of tree sort (when implemented with a balanced tree)?

A

O(n)

B

O(n log n)

C

O(n2)

D

O(log n)

What is the worst case time complexity of tree sort (when implemented with an unbalanced tree)?

A

O(n)

B

O(n log n)

C

O(n2)

D

O(log n)

What is the time complexity improvement of skip lists from linked lists in insertion and deletion?

A

O(n) to O(logn) where n is number of elements

B

O(n) to O(1) where n is number of elements

C

no change

D

O(n) to O(n2) where n is number of elements

To restore the AVL property after inserting a element, we start at the insertion point and move towards root of that tree. is this statement true?

A

true

B

false

B-tree and AVL tree have the same worst case time complexity for insertion and deletion.

Related Questions