Question 1     

A

A tree with exactly 3 children



B

A Tree which is balanced



C

A Binary Search Tree which is height balanced 



D

None of the above

Question 2     

A

Search



B

Delete



C

Insert



D

Maximum

Question 3     

A

Max Heap



B

Sorted array



C

AVL Tree



D

Binary Search Tree

Question 4     

A

Approved Vendor List



B

Audio Video Library



C

Adelson-Velskii and Landis



D

Avery-Valirie Logan Tree

Question 5     

A

Only 1



B

Only 2



C

Both 1 and 2



D

None of the above

Question 6     

A

N



B

N/2



C

log(n)



D

N²

Question 7     

A

Top-Down



B

Bottom-Up

Question 8     

A

n*logn



B

n²



C

n*2ⁿ



D

log(n)²

Question 9     

A

Build the tree with given input



B

Using Dynamic Programming



C

just build the tree with the given input



D

Find the median, and make it as root and repeat this process recursively

Question 10     

A

AVL Tree



B

Red Black Tree



C

Splay Tree



D

All of the above



E

Only 1