222 finish

Author: aQuaYi

Algorithms/0222.count-complete-tree-nodes/README.md

@@ -0,0 +1,22 @@
+# [222. Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes/)
+
+Given a complete binary tree, count the number of nodes.
+
+Note:
+
+Definition of a complete binary tree from [Wikipedia](http://en.wikipedia.org/wiki/Binary_tree#Types_of_binary_trees):
+
+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.
+
+Example:
+
+```text
+Input:
+    1
+   / \
+  2   3
+ / \  /
+4  5 6
+
+Output: 6
+```

Algorithms/0222.count-complete-tree-nodes/count-complete-tree-nodes.go

@@ -1,28 +1,25 @@
 package problem0222
 
-type TreeNode struct {
-	Val   int
-	Left  *TreeNode
-	Right *TreeNode
-}
+import (
+	"github.com/aQuaYi/LeetCode-in-Go/kit"
+)
 
-func countNodes(root *TreeNode) int {
-	if root == nil {
-		return 0
-	}
+// TreeNode is predefined in kit
+type TreeNode = kit.TreeNode
 
+func countNodes(root *TreeNode) int {
 	count := 0
 	traverse(root, &count)
 	return count
 }
 
-func traverse(node *TreeNode, count *int) {
-	if node == nil {
+func traverse(n *TreeNode, count *int) {
+	if n == nil {
 		return
 	}
 
 	*count++
 
-	traverse(node.Left, count)
-	traverse(node.Right, count)
+	traverse(n.Left, count)
+	traverse(n.Right, count)
 }

Algorithms/0222.count-complete-tree-nodes/count-complete-tree-nodes_test.go

@@ -10,6 +10,7 @@ var questions = []struct {
 	pre, in []int
 	count   int
 }{
+
 	{
 		[]int{},
 		[]int{},