https://leetcode.com/problems/average-of-levels-in-binary-tree/

Author: harshitgindra

LeetCodeSolutions/BinaryTreeBfs/AverageLevelsOfBinaryTree.cs

@@ -0,0 +1,57 @@
+
+namespace LeetCodeSolutions.BinaryTreeBfs;
+
+public class AverageLevelsOfBinaryTree
+{
+    public IList<double> AverageOfLevels(TreeNode root) {
+        
+        Dictionary<int, Tuple<int, long>> map = new Dictionary<int, Tuple<int, long>>();
+        _dfs(root, 0, map);
+
+        IList<double> result = new List<double>();
+        foreach (var kvp in map)
+        {
+            result.Add((double)kvp.Value.Item2 / kvp.Value.Item1);
+        }
+
+        return result;
+    }
+
+    private void _dfs(TreeNode node, int depth, Dictionary<int, Tuple<int, long>> map)
+    {
+        if (node != null)
+        {
+            if (map.ContainsKey(depth))
+            {
+                var currentVal = map[depth];
+                map[depth] = Tuple.Create(currentVal.Item1 + 1, currentVal.Item2 + node.val);
+            }
+            else
+            {
+                map[depth] = Tuple.Create(1, (long)node.val);
+            }
+            _dfs(node.left, depth + 1, map);
+            _dfs(node.right, depth + 1, map);
+        }
+    }
+    
+    [Test(Description = "https://leetcode.com/problems/average-of-levels-in-binary-tree")]
+    [Category("Easy")]
+    [Category("LeetCode")]
+    [Category("Average Of Levels in Binary Tree")]
+    [TestCaseSource(nameof(Input))]
+    [Category("Binary Tree BFS")]
+    [Category("TopInterview")]
+    public void Test1((IList<double> Output, int?[] Input) item)
+    {
+        var response = AverageOfLevels(item.Input.ToTreeNode());
+        Assert.That(response, Is.EqualTo(item.Output));
+    }
+
+    public static IEnumerable<(IList<double> Output, int?[] Input)> Input =>
+        new List<(IList<double> Output, int?[] Input)>()
+        {
+            ([3.00000,14.50000,11.00000], [3,9,20,null,null,15,7]),
+            ([2147483647.00000,2147483647.00000], [2147483647,2147483647,2147483647]),
+        };
+}

LeetCodeSolutions/Usings.cs

@@ -1 +1,2 @@
-global using NUnit.Framework;
+global using NUnit.Framework;
+global using LeetCodeSolutions.Utils;

README.md

@@ -2,7 +2,7 @@
 
 ![](https://img.shields.io/badge/Neovim-57A143.svg?logo=Neovim&logoColor=white)
 ![](https://img.shields.io/badge/Visual_Studio_Code-0078D4?logo=visual%20studio%20code&logoColor=white)
-![](https://img.shields.io/badge/Progress-28%2F150-0078D4)
+![](https://img.shields.io/badge/Progress-29%2F150-0078D4)
 
 This repository contains solutions to the Leetcode Top Interview 150 problems.
 
@@ -135,7 +135,7 @@ The Top Interview 150 collection on Leetcode is a curated set of 150 interview q
 | 81                                           | Lowest Common Ancestor of a Binary Tree                                                                   | Medium     |        |
 | <br>        Binary Tree BFS<br>              |                                                                                                           |            |        |
 | 8282                                         | Binary Tree Right Side View                                                                               | Medium     |        |
-| 83                                           | Average of Levels in Binary Tree                                                                          | Easy       |        |
+| 83                                           | Average of Levels in Binary Tree                                                                          | Easy       |    ✅    |
 | 84                                           | Binary Tree Level Order Traversal                                                                         | Medium     |        |
 | 85                                           | Binary Tree Zigzag Level Order Traversal                                                                  | Medium     |        |
 | <br>        Binary Search Tree<br>           |                                                                                                           |            |        |