Beginner Data Structures & Algorithms
Q17 / 100

What is the height of a balanced binary tree with n nodes?

Correct! Well done.

Incorrect.

The correct answer is C) O(log n)

C

Correct Answer

O(log n)

Explanation

A balanced binary tree has O(log n) height since each level roughly doubles the node count. This ensures O(log n) operations.

Previous All Questions Next
Progress
17/100
🌳

Browse All Data Structures & Algorithms Questions

100 questions · beginner to advanced