2/19

Question 1

BST

Answer 1

Binary Search Tree: Binary tree in which key of internal node is greater than the keys of its left subtree and less than or equal to the keys of its right subtree.

Question 2

Divide and Conquer

Answer 2

Divide problem into 2 or more smaller instances. Solve smaller instances. Combine solutions.