GoLang Solution For LeetCode Problem: Count Complete Tree Nodes
Given a complete binary tree, count the number of nodes.
Definition of a complete binary tree from Wikipedia: In a complete binary tree every level, except possibly the last, is completely filled, 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.
Input: 1 / \ 2 3 / \ / 4 5 6 Output: 6
See the full details of the problem Count Complete Tree Nodes at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go