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

• True Correct
• False