BUT Informatique

Practice session

What is the tightest asymptotic time complexity (Big O) for finding an element in a balanced Binary Search Tree (such as an AVL tree or Red-Black tree) containing n nodes?

Loading your practice session…