binary search tree (BST)

 requires array in sorted order

requires random access of arrays

very powerful because big O of logn

location in week 5 video: 1:20:00

source: harvard cs50, david malan