Count Complete Tree Nodes | count complete tree nodes | count complete tree nodes leetcode

preview_player
Показать описание

**Complexity Analysis**
Time Complexity: O(log(n) ^ 2)

Рекомендации по теме
Комментарии
Автор

Can you explain the time complexity, how it is O(logn * logn)

akhilkhubchandani
Автор

why do null children return -1 ? shouldn't you simply return 0 since it is not contributing to the total height ?

mohammedjawahri
welcome to shbcf.ru