add todo for 222

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_222.java

@@ -3,8 +3,10 @@
 import com.fishercoder.common.classes.TreeNode;
 
 /**
+ * 222. Count Complete Tree Nodes
+ *
  * Given a complete binary tree, count the number of nodes.
- * <p>
+ *
  * Definition of a complete binary tree from Wikipedia:
  * In a complete binary tree every level,
  * except possibly the last, is completely filled,
@@ -13,7 +15,7 @@
  */
 public class _222 {
 
-    class Solution1 {
+    class SolutionRecursive {
         /**reference: https://discuss.leetcode.com/topic/21317/accepted-easy-understand-java-solution/2*/
         public int countNodes(TreeNode root) {
             int leftH = getLeftHeight(root);
@@ -39,11 +41,14 @@ private int getLeftHeight(TreeNode root) {
             }
             return height;
         }
-
     }
 
     public static void main(String...args) {
         System.out.println(1 << 3);
     }
 
+    class SolutionIterative {
+        /**TODO: implement an iterative solution*/
+    }
+
 }