From 8310c95e86ee21a26012e15a2da04749d868fec4 Mon Sep 17 00:00:00 2001
From: Beena P Jha <jhabeena95@gmail.com>
Date: Tue, 29 Oct 2019 21:12:27 +0530
Subject: [PATCH] Create Tree Traversal - Level Order

---
 Tree Traversal - Level Order | 22 ++++++++++++++++++++++
 1 file changed, 22 insertions(+)
 create mode 100644 Tree Traversal - Level Order

diff --git a/Tree Traversal - Level Order b/Tree Traversal - Level Order
new file mode 100644
index 0000000..03a60eb
--- /dev/null
+++ b/Tree Traversal - Level Order	
@@ -0,0 +1,22 @@
+
+#Level Order Tree Traversal
+class Solution:
+	def levelOrder(self, root: TreeNode) -> List[List[int]]:
+		if not root:
+			return 
+		track = [root]
+		stack = []
+		while (track!=[]):
+			temp = []
+			valtemp = []
+			for i in range(len(track)):
+				if track[i]:
+					temp.append(track[i].left)
+					temp.append(track[i].right)
+					valtemp.append(track[i].val)
+			track = temp
+			if valtemp==[]:
+				return stack
+			else:
+				stack.append(valtemp)
+		return stack