1. BINARY SEARCH TREES. MIN AND MAX. INSERT AND DELETE OPERATIONS. AVL TREES. SINGLE ROTATION AND DOUBLEROTATION 2. A binary search tree is a binary tree…
* Computational Geometry Chapter 12 * Range queries How do you efficiently find points that are inside of a rectangle? Orthogonal range query ([x1, x2], [y1,y2]): find all…