1-If you have a sorted, balanced binary tree with 15 elements in it, how many steps, maximum, will it take you to decide whether an element is present in the tree?
2-Modern filesystems, like ReiserFS and XFS, use which structure to organize their data for efficient access?
3- A vector (an indexed, growable list) would most likely be implemented on top of which of these structures?