The height of binary tree is maximum of all depths . Find the maximum in depth [ ] and assign it to ht
ht = depth [ 0 ] NEW_LINE for i in range ( 1 , n ) : NEW_LINE INDENT ht = max ( ht , depth [ i ] ) NEW_LINE DEDENT return ht NEW_LINE