@@ -0,0 +1,886 @@
+%22%22%22Leetcode 222. Count Complete Tree Nodes%0AMedium%0A%0AURL: https://leetcode.com/problems/count-complete-tree-nodes/%0A%0AGiven a complete binary tree, count the number of nodes.%0A%0ANote:%0A%0ADefinition of a complete binary tree from Wikipedia:%0AIn a complete binary tree every level, except possibly the last,%0Ais completely filled, and all nodes in the last level are as far left as%0Apossible. It can have between 1 and 2h nodes inclusive at the last level h.%0A%0AExample:%0AInput: %0A    1%0A   / %5C%0A  2   3%0A / %5C  /%0A4  5 6%0AOutput: 6%0A%22%22%22%0A%0A# Definition for a binary tree node.%0Aclass TreeNode(object):%0A    def __init__(self, val):%0A        self.val = val%0A        self.left = None%0A        self.right = None%0A%0A%0Aclass Solution(object):%0A    def countNodes(self, root):%0A        %22%22%22%0A        :type root: TreeNode%0A        :rtype: int%0A        %22%22%22%0A        pass%0A%0A%0Adef main():%0A    pass%0A%0A%0Aif __name__ == '__main__':%0A    main()%0A

Add lc0222_count_complete_tree_nodes.py