Add Binary Tree Level Order Traversal

Author: Ozge Cimendere

LeetCode/102-BinaryTreeLevelOrderTraversal.cs

@@ -0,0 +1,32 @@
+
+
+namespace LeetCode {
+ public partial class Solution {
+ public IList<IList<int>> LevelOrder(TreeNode root) {
+ var result = new Collection<IList<int>>();
+ if(root == null) {
+ return result;
+ }
+ 
+ Queue<TreeNode> queue = new Queue<TreeNode>();
+ queue.Enqueue(root);
+ 
+ while(queue.Count > 0) {
+ var levelSize = queue.Count();
+ var sizeResult = new List<int>();
+ for (int i = 0; i < levelSize; i++)
+ {
+ var node = queue.Dequeue();
+ sizeResult.Add(node.val);
+ if(node.left != null)
+ queue.Enqueue(node.left);
+ if(node.right != null)
+ queue.Enqueue(node.right);
+ }
+ result.Add(sizeResult);
+ }
+
+ return result;
+ }
+ }
+}

README.md

@@ -5,6 +5,7 @@ LeetCode C# solutions
 |---| ----- | -------- | ---------- |
 |**1**| **[Two Sum](https://leetcode.com/problems/two-sum/)** | **[C#](https://github.com/ocimen/leetcode/blob/main/LeetCode/1-TwoSum.cs)** | **Easy** |
 |**21**| **[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)** | **[C#](https://github.com/ocimen/leetcode/blob/main/LeetCode/21-MergeTwoSortedLists.cs)** | **Easy** |
+|**102**| **[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)** | **[C#](https://github.com/ocimen/leetcode/blob/main/LeetCode/21-MergeTwoSortedLists.cs)** | **Medium** |
 |**141**| **[Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/)** | **[C#](https://github.com/ocimen/leetcode/blob/main/LeetCode/141-LinkedListCycle.cs)** | **Easy** |
 |**142**| **[Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/)** | **[C#](https://github.com/ocimen/leetcode/blob/main/LeetCode/142-LinkedListCycleII.cs)** | **Medium** |
 |**202**| **[Happy Number](https://leetcode.com/problems/happy-number/)** | **[C#](https://github.com/ocimen/leetcode/blob/main/LeetCode/202-HappyNumber.cs)** | **Easy** |