ABSTRACT
Binary trees are also suitable for applying dichotomy. Based on binary trees, there are some derived data structures:
1. Binary search trees (BSTs), which are used to improve efficiency for search 2. Binary heaps, which are used to store priority queues 3. Huffman trees, which are used for data encoding
10.1 Binary Search Trees In computer science, a search algorithm is to find an item with specified properties among a collection of items. There are three kinds of search methods:
1. Sequential search: The search starts from the first element in a linear list, and elements are searched one by one to find the item with specified properties. Its time complexity is O(n).
