###### android

####
19. Java Data Structure-Binary Tree Sorting Tree

1. First look at a demand Give you a number sequence (7, 3, 10, 12, 5, 1, 9), which requires efficient completion of the query and addition of data 1.1 Using arrays The array is not sorted. Advantages: add directly at the end of the array, which is fast. Disadvantage: slow search speed. [Schematic] Array sorting, advantages: you can use binary search, the search speed is fast, disadvantages: in order to ensure the order of the array, when adding new data, find the insertion position 1.2 Use chai