Binary Trees & BST

Question 1

What is a binary search tree (BST)?

Answer 1

Left subtree < root < right subtree.

Question 2

What is the difference between a BST and a heap?

Answer 2

BST supports ordered access, Heap is optimized for min/max extraction.

Question 3

What is an AVL tree?

Answer 3

Self-balancing BST.

Question 4

What is the purpose of tree rotations in AVL trees?

Answer 4

Used in AVL trees to maintain balance.