Recently discovered in Java library, one is called TreeSet, it can be ordered to return values, it is the bottom of the balanced tree, so the time complexity (add, delete) are O (nlogn), the total time complexity is O (nlogn), its tree is in the list, just don't like the heap array, may occupy a larger space,