From 2bcd88a096d694b295a855062339579458c0769f Mon Sep 17 00:00:00 2001
From: "Zhen (Evan) Wang" <273509239@qq.com>
Date: Tue, 14 Jan 2025 11:18:41 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200102.=E4=BA=8C=E5=8F=89?=
 =?UTF-8?q?=E6=A0=91=E7=9A=84=E5=B1=82=E5=BA=8F=E9=81=8D=E5=8E=86-=20637.?=
 =?UTF-8?q?=E4=BA=8C=E5=8F=89=E6=A0=91=E7=9A=84=E5=B1=82=E5=B9=B3=E5=9D=87?=
 =?UTF-8?q?=E5=80=BC=20C#=20=E7=89=88=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

637.二叉树的层平均值 C# 版本
---
 problems/0102.二叉树的层序遍历.md | 29 +++++++++++++++++++++++
 1 file changed, 29 insertions(+)

diff --git a/problems/0102.二叉树的层序遍历.md b/problems/0102.二叉树的层序遍历.md
index 0c3b0f8c..ce53e49a 100644
--- a/problems/0102.二叉树的层序遍历.md
+++ b/problems/0102.二叉树的层序遍历.md
@@ -1599,6 +1599,35 @@ impl Solution {
 }
 ```
 
+#### C#:
+
+```C# 二叉树的层平均值
+public class Solution {
+    public IList<double> AverageOfLevels(TreeNode root) {
+        var result= new List<double>();
+        Queue<TreeNode> queue = new();
+        if(root !=null) queue.Enqueue(root);
+        
+        while (queue.Count > 0)
+        {
+            int count = queue.Count;
+            double value=0;
+            for (int i = 0; i < count; i++)
+            {
+                var curentNode=queue.Dequeue();
+                value += curentNode.val;
+                if (curentNode.left!=null) queue.Enqueue(curentNode.left);
+                if (curentNode.right!=null) queue.Enqueue(curentNode.right);
+            }
+            result.Add(value/count);
+        }
+
+        return result;
+    }
+}
+
+```
+
 ## 429.N叉树的层序遍历
 
 [力扣题目链接](https://leetcode.cn/problems/n-ary-tree-level-order-traversal/)