A client is seeking advice on what tree structure should be used as the data structure for a given set of data, given the following properties of the data. Based on these properties, suggest either a binary tree, a BST$,$ an AVL tree, or a B$-$Tree. Justify your choice to the client in few sentences, explaining how its the best choice given these three conditions $($you should tie each condition into your answer$).$

Not much disk access is expected. Data records must support effective search methods. Insert, delete, and other tree operations will be run often and ideally should be efficient.