The height of a perfectly balanced binary tree with n nodes is ____. A) logn B) n² C) nlogn D) log₂n

Name: The height of a perfectly balanced binary tree with n nodes is ____. A) logn B) n 2 C) nlogn D) log 2 n
Brand: Quizplus
Rating: 4.7 (33 reviews)

Question

Quizplus · Accepted Answer

The height of a perfectly balanced binary tree is given by log₂(n+1), which is represented in the question as log₂n (choice D using subscript notation for the base of the logarithm).

The Height of a Perfectly Balanced Binary Tree with N