From 37d518f77632a920bb1dbf84a9ab34472437c431 Mon Sep 17 00:00:00 2001
From: Galaxies2580 <xiaoyl995@163.com>
Date: Mon, 26 Sep 2022 09:23:45 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A00222.=E5=AE=8C=E5=85=A8?=
 =?UTF-8?q?=E4=BA=8C=E5=8F=89=E6=A0=91=E7=9A=84=E8=8A=82=E7=82=B9=E4=B8=AA?=
 =?UTF-8?q?=E6=95=B0Go=E7=89=88=E6=9C=AC.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../0222.完全二叉树的节点个数.md    | 27 +++++++++++++++++++
 1 file changed, 27 insertions(+)

diff --git a/problems/0222.完全二叉树的节点个数.md b/problems/0222.完全二叉树的节点个数.md
index dc037f0a..eecc4dc1 100644
--- a/problems/0222.完全二叉树的节点个数.md
+++ b/problems/0222.完全二叉树的节点个数.md
@@ -437,6 +437,33 @@ func countNodes(root *TreeNode) int {
 }
 ```
 
+迭代法
+
+```go
+func countNodes(root *TreeNode) int {
+    if root == nil {
+        return 0
+    }
+    q := list.New()
+    q.PushBack(root)
+    res := 0
+    for q.Len() > 0 {
+        n := q.Len()
+        for i := 0; i < n; i++ {
+            node := q.Remove(q.Front()).(*TreeNode)
+            if node.Left != nil {
+                q.PushBack(node.Left)
+            }
+            if node.Right != nil {
+                q.PushBack(node.Right)
+            }
+            res++
+        }
+    }
+    return res 
+}
+```
+
 
 
 ## JavaScript: