Picking the Red-Black Tree and Binary search tree will do equally. But the worst case is that the data are sorted in ascending. Or less to the Red-Black Tree will be much better. Until ineligible to use binary search tree work at all. (Also, if the increase in data volumes and the search Binary search tree will cause Stack overflow, too), so now compared Library and would not choose to write regular Template With Binary search tree.
การแปล กรุณารอสักครู่..