Add files via upload

Author: Manasi2001

Diff for: Trees/BST Level Order Traversal/BST_level_order_traversal.py

@@ -0,0 +1,77 @@
+'''
+Aim: To perform level-order traversal on a BST.
+
+'''
+
+# initializing the tree
+class Node:
+    def __init__(self,data):
+        self.right=self.left=None
+        self.data = data
+        
+class Solution:
+    # inserting node
+    def insert(self,root,data):
+        if root==None:
+            return Node(data)
+        else:
+            if data<=root.data:
+                cur=self.insert(root.left,data)
+                root.left=cur
+            else:
+                cur=self.insert(root.right,data)
+                root.right=cur
+        return root
+    # performing level order traversal
+    # the values will be printed according to the level they are in
+    def levelOrder(self,root):
+        if root is None:
+            return 
+        q = []
+        q.append(root)
+        while len(q) !=0:
+            p = q.pop(0)
+            print(p.data, end=' ')
+            if p.left is not None:
+                q.append(p.left)
+            if p.right is not None:
+                q.append(p.right)
+        return q
+    
+# getting the input    
+T=int(input())
+myTree=Solution()
+root=None
+for i in range(T):
+    data=int(input())
+    root=myTree.insert(root,data)
+# printing the result
+myTree.levelOrder(root)
+
+'''
+COMPLEXITY:
+	
+	 Time Complexity -> O(N)
+	 Space Complexity -> O(N)
+     
+Sample Input:
+6
+3
+5
+4
+7
+2
+1
+Sample Output:
+3 2 5 1 4 7
+
+Explaination:
+The BST looks something like this:
+    
+                3                    Level 0
+            2       5                Level 1
+        1        4      7            Level 2
+ 
+So, starting from level 0 and going to level 2, traversal will look like: 3, 2 5, 1 4 7.
+
+'''

Diff for: Trees/BST Level Order Traversal/Images/ss.png

@@ -0,0 +1,45 @@
+# BST - Level Order Traversal 
+
+## Aim
+
+To perform Level Order Traversal on a Binary Search Tree.
+
+
+## Purpose
+
+The purpose is to explore a type of traversal for BST.
+
+
+## Short description of package/script
+
+- The user enters the numbers to be used for constructing a BST.
+- The BST is constructed according to the rules, with each node having an element entered by the user.
+- Level by level the numbers are displayed.
+
+
+## Workflow of the Project
+
+- The tree is initialized.
+- Nodes are inserted.
+- Level order traversal is performed.
+- The values will be printed according to the level they are in.
+
+
+## Compilation Steps
+
+After the script is run, enter:
+
+1. Total number of nodes.
+2. All the nodes one by one.
+
+That's it! The numbers will accordingly get printed.
+
+
+## Output
+
+<img src="../BST Level Order Traversal/Images/ss.png"> 
+
+
+## Author
+
+[Manasi Chhibber](https://github.com/Manasi2001)