VCE FDP DAY-7 24 JAN 2024

Which of the following is false about a binary search tree?

• The left child is always lesser than its parent
• The right child is always greater than its parent
• The left and right sub-trees should also be binary search trees
• In order sequence gives decreasing order of elements

What is the speciality about the inorder traversal of a binary search tree?

• It traverses in a non increasing order
• It traverses in an increasing order
• It traverses in a random fashion
• It traverses based on priority of the node

What are the worst case and average case complexities of a binary search tree?

• O(n), O(n)
• O(logn), O(logn)
• O(logn), O(n)
• O(n), O(logn)

Trie is also known as _________

• Digital Tree
• Treap
• Binomial Tree
• 2-3 Tree

What traversal over trie gives the lexicographical sorting of the set of the strings?

• postorder
• preorder
• inorder
• Level order

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

• BST
• Linked List
• Balanced BST
• Trie

A program to search a contact from phone directory can be implemented efficiently using ______

• a BST
• a trie
• a balnced BST
• a binary tree

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