Answer to Question #278006 in C for Amit

Question

“If the height of a tree is reduced and balanced, then the searching time also get reduced.” (True/ False) Justify.

Answer 1

Answer: True

Explanation: The search algorithm works for an $O(\log n)$ time, where $\log n$ is equal to the height of a tree. From here if the height of a tree is reduced and balanced, then the searching time also will reduce, too.