Binary Search Tree (BST)

What is a key characteristic that distinguishes a BST from a regular binary tree?

• Every node has exactly one child
• The tree has at most 10 nodes
• Nodes contain strings only
• For each node, values in the left subtree are less than the node's value and values in the right subtree are greater

In a BST, where would you insert a value that is greater than the root's value?

• In the left subtree of the root
• In the right subtree of the root
• As a new root
• Cannot be inserted

If a BST has a node with a value of 50, and its right child has a value of 60, which value can be a valid value for the right child's left child?

• 40
• 55
• 65
• 100

What can be a direct consequence of repeatedly inserting sorted data (e.g., 1, 2, 3, 4,...) into an initially empty BST?

• The BST will be balanced
• The BST will be similar to a linked list
• The BST will have only left children
• The BST will not allow any more insertions

Which of the following is a valid application for a BST?

• Image compression
• Keeping a sorted list of numbers in real-time
• Sound processing
• Video streaming

If a node in a BST has no left child, which statement is true?

• The node has no children at all
• The node's value is the smallest in the tree
• The node is guaranteed to be a leaf
• None of the above

In a BST, which traversal method will give a sorted list of values in ascending order?

• Pre-order traversal
• In-order traversal
• Post-order traversal
• Level-order traversal

How can you ensure faster average-case performance for operations like insert, delete, and search in a BST?

• By using a self-balancing BST
• By using a regular linked list
• By converting the BST to an array
• By making the BST as deep as possible

A BST is said to be balanced if:

• All nodes have either 0 or 2 children
• Heights of two subtrees of any node never differ by more than one
• It has maximum number of nodes
• The root node is the largest value in the tree

What is the purpose of the Node class?

• To represent the BST
• To hold tree values
• For traversal
• To represent a tree node