Big O of finding out if a binary tree is balanced (From CTCI Book)

Question

In Cracking the Coding Interview 6th Edition there\'s a question (4.4) where you\'re suppose to find out if a binary tree is balanced, where balanced in this case means if a

Answer 1

Your algorithm time complexity is T(n) = 2T(n/2) + 1. Hence, time complexity of your algorithm would be T(n) = O(n). However, the correctness of your algorithm is under question.