adeed

itspratham · itspratham · commit 6ccc7213de30 · 2024-07-05T15:38:26.000+05:30
diff --git a/Python_Contents/data_structures/Binary_Tree/level-order.py b/Python_Contents/data_structures/Binary_Tree/level-order.py
@@ -0,0 +1,25 @@
+class Node:
+    def __init__(self, data):
+        self.left = None
+        self.right = None
+        self.data = data
+
+
+def level_order(root):
+    a_Queue = [root]
+    while len(a_Queue) > 0:
+        popped_item = a_Queue.pop(0)
+        print(popped_item.data, end=" ->")
+        if popped_item.left:
+            a_Queue.append(popped_item.left)
+        if popped_item.right:
+            a_Queue.append(popped_item.right)
+
+
+root = Node(5)
+root.left = Node(3)
+root.right = Node(6)
+root.left.left = Node(2)
+root.left.right = Node(4)
+root.left.right.left = Node(1)
+level_order(root)
