Q1.What defines a binary search tree (BST)?
Q2.Which traversal order visits a BST's nodes in sorted (ascending) order?
Q3.What is the time complexity of search in a balanced BST versus a completely unbalanced (degenerate) one?
Q4.What traversal strategy does BFS (level-order traversal) use to visit tree nodes?
