Skip to content

Tag Archives: Balanced Binary Search Trees

What is the worst case possible height of AVL tree? (A) 2Logn Assume base of log is 2 (B) 1.44log n Assume base of log… Read More
What is the maximum height of any AVL-tree with 7 nodes? Assume that the height of a tree with a single node is 0. (A)… Read More
The worst case running time to search for an element in a balanced in a binary search tree with n2^n elements is (A) (B) (C)… Read More

Start Your Coding Journey Now!