Binary search trees and AVL trees 8-1 Binary search treesProblem: Store ordered data in an array structure : efficient search algorithm, inefficient insertion and deletion Linked list: efficient insertion and deletion ,inefficient search Binary search trees can satisfy both of themDefinition: the properties of a binary search treeAll items in the left subtree are less than the rootAll items in the right subtree are greater than or equal to the rootEach subtree is itself a binary search tree.
Op ...