#CS-6202
Awesome StudentQuestion • Algorithms and Complexity

Like other balanced Binary Search Trees, time complexity to search, insert and delete is O(log n)

Answer

True