Binary Search Tree Quiz

In a Binary Search Tree (BST), what is the value of a node called with respect to its left subtree?

• Predecessor

• Successor

• Ancestor

• Descendant

Which of the following is not a property of a Binary Search Tree (BST)?

• In-order traversal gives nodes in sorted order

• Each node has at most two children

• Left subtree of a node contains nodes with values less than the node's value

• Right subtree of a node contains nodes with values greater than the node's value

Which traversal of a Binary Search Tree (BST) will give nodes in non-decreasing order?

• Pre-order

• Post-order

• In-order

• Level-order

Which of the following is a disadvantage of Binary Search Trees (BSTs)?

• Search operation is fast

• Insertion and deletion can be slow in the worst case

• Requires less memory compared to other tree structures

• Suitable for all types of data

In a Binary Search Tree (BST), what is the maximum number of nodes at level "h"?

• 2^h

• 2^(h-1)

• h

• h^2

What is the time complexity of searching for a value in a balanced Binary Search Tree (BST)?

• O(n)

• O(log n)

• O(n log n)

• O(1)

In a Binary Search Tree (BST), which operation is used to remove a node with two children?

• Delete

• Erase

• Remove

• None of the above

What is a Binary Search Tree (BST)?

• A tree with only one child node

• A tree in which each node has at most two children, and for each node, all elements in the left subtree are less than the node's value, and all elements in the right subtree are greater than the node's value

• A tree where each node has exactly two children

• A tree with no children

Which of the following trees is a self-balancing Binary Search Tree (BST)?

• AVL Tree

• Binary Tree

• Red-Black Tree

• Trie

Which of the following operations can be performed on a Binary Search Tree (BST) in O(log n) time?

• Insertion

• Deletion

• Search

• All of the above