Binary tree sort implemented using a self balancing binary search tree takes O(n log n) time in the worst case but still it is slower than merge sort.

What is the time complexity of searching for an element in a Binary Search Tree (BST) in the worst case?

A. O(1)

B. O(log n)

C. O(n)

D. O(n log n)

Which traversal method of a BST will produce a sorted sequence of node values?

A. Inorder

B. Preorder

C. Postorder

D. Level-order

What is the maximum number of children a node in a Binary Search Tree (BST) can have?

A. 1

B. 2

C. 3

D. Any number

How can you determine if a Binary Tree is a Binary Search Tree (BST)?

A. Verify if all nodes in the left subtree are less than the root and all nodes in the right subtree are greater than the root.

B. Check if the tree is balanced.

C. Ensure all nodes have exactly two children.

D. Verify the height of the tree.