[Golang][Leetcode][BinaryTree]刷題系列-222-Count Complete Tree Nodes
222. Count Complete Tree Nodes
Level : Medium
原題連結 : Click
Given the root of a complete binary tree, return the number of the nodes in the tree.
According to Wikipedia, every level, except possibly the last, is completely filled in a complete binary tree, and all nodes in the last level are as far left as possible. It can have between 1 and 2h nodes inclusive at the last level h.
Design an algorithm that runs in less than O(n) time complexity.
Input: root = [1,2,3,4,5,6] Output: 6
Input: root =  Output: 0
Input: root =  Output: 1
- time complexity: O(n) , space complexity: O(1)
Runtime: 12 ms, faster than 99.33% of Go online submissions for Count Complete Tree Nodes.
最後祝福努力認真的各位 “All your dream of are hidden in your daily life” 我們峰頂見!!!