（是非題）Since a Deap contains a subtree of min-heap and a subtree of max-heap, its find(), deleteMin(), and deleteMax() operations can all have O(log n) time complexities.