From bf294018160b318f8424ad93764b29e289824b94 Mon Sep 17 00:00:00 2001
From: Jayvardhan Rathi
 <39644109+ComputerScientist-01@users.noreply.github.com>
Date: Wed, 4 Aug 2021 21:38:24 +0530
Subject: [PATCH] Create README - LeetHub

---
 average-of-levels-in-binary-tree/README.md | 24 ++++++++++++++++++++++
 1 file changed, 24 insertions(+)
 create mode 100644 average-of-levels-in-binary-tree/README.md

diff --git a/average-of-levels-in-binary-tree/README.md b/average-of-levels-in-binary-tree/README.md
new file mode 100644
index 0000000..691f63d
--- /dev/null
+++ b/average-of-levels-in-binary-tree/README.md
@@ -0,0 +1,24 @@
+<h2>637. Average of Levels in Binary Tree</h2><h3>Easy</h3><hr><div>Given the <code>root</code> of a binary tree, return <em>the average value of the nodes on each level in the form of an array</em>. Answers within <code>10<sup>-5</sup></code> of the actual answer will be accepted.
+<p>&nbsp;</p>
+<p><strong>Example 1:</strong></p>
+<img alt="" src="https://assets.leetcode.com/uploads/2021/03/09/avg1-tree.jpg" style="width: 277px; height: 302px;">
+<pre><strong>Input:</strong> root = [3,9,20,null,15,7]
+<strong>Output:</strong> [3.00000,14.50000,11.00000]
+Explanation: The average value of nodes on level 0 is 3, on level 1 is 14.5, and on level 2 is 11.
+Hence return [3, 14.5, 11].
+</pre>
+
+<p><strong>Example 2:</strong></p>
+<img alt="" src="https://assets.leetcode.com/uploads/2021/03/09/avg2-tree.jpg" style="width: 292px; height: 302px;">
+<pre><strong>Input:</strong> root = [3,9,20,15,7]
+<strong>Output:</strong> [3.00000,14.50000,11.00000]
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li>The number of nodes in the tree is in the range <code>[1, 10<sup>4</sup>]</code>.</li>
+	<li><code>-2<sup>31</sup> &lt;= Node.val &lt;= 2<sup>31</sup> - 1</code></li>
+</ul>
+</div>
\ No newline at end of file