ADS LAB Quiz-1

The number of edges from the node to the deepest leaf is called _________ of

the tree.

• Height

• Depth

• Length

• Width

What is a full binary tree?

• Each node has exactly zero or two children

• Each node has exactly two children

• All the leaves are at the same level

• Each node has exactly one or two children

Which of the following is the most widely used external memory data structure?

• AVL tree

• B-tree

• Red-black tree

• Both AVL tree and Red-black tree

B-tree of order n is a order-n multiway tree in which each non-root node contains ______________

• at most (n – 1)/2 keys

• exact (n – 1)/2 keys

• at least 2n keys

• at least (n – 1)/2 keys

A B-tree of order 4 and of height 3 will have a maximum of _______ keys.

• 255

• 63

• 127

• 188

AVL trees provide better insertion the 2-3 trees.

• True

• False

Which of the following data structure can provide efficient searching of the elements?

• unordered lists

• binary search tree

• treap

• 2-3 tree

Which of the following is the simplest data structure that supports range searching?

• Heaps

• binary search trees

• AA-trees

• K-d trees

In a k-d tree, k originally meant?

• number of dimensions

• size of tree

• length of node

• weight of node

Which of the following is the efficient data structure for searching words in dictionaries?

• BST

• Linked List

• Balanced BST

• Trie