Count complete tree nodes
You are given a complete binary tree as a level-order array `level` (no gaps; every level except possibly the last is full and the last level is filled left to right). Count the total number of nodes. Aim for better than O(n): a complete tree of n nodes admits an O(log^2 n) count. `0 <= len(level) <= 100000`.
Implement
count_complete_nodes(level: list[int]) → intExamples
in
[[1,2,3,4,5,6]]out6What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
[[1,2,3,4,5,6]]6not run yetsample