Add files via upload

Author: AdityaSeth777

23 - BST Level-Order Traversal/Solution.c

@@ -0,0 +1,108 @@
+#include <stdio.h>
+#include <string.h>
+#include <math.h>
+#include <stdlib.h>
+
+struct node {
+    
+    int data;
+    struct node *left;
+    struct node *right;
+  
+};
+
+struct node* insert( struct node* root, int data ) 
+{
+		
+	if(root == NULL) 
+	{
+	
+        struct node* node = (struct node*)malloc(sizeof(struct node));
+
+        node->data = data;
+
+        node->left = NULL;
+        node->right = NULL;
+        return node;
+	  
+	} 
+	else 
+	{
+      
+		struct node* cur;
+		
+		if(data <= root->data) 
+		{
+            cur = insert(root->left, data);
+            root->left = cur;
+		} 
+		else 
+		{
+            cur = insert(root->right, data);
+            root->right = cur;
+		}
+	
+		return root;
+	}
+}
+
+
+int height(struct node* node) 
+{ 
+    if (node==NULL) 
+        return 0; 
+    else
+    { 
+        
+        int lheight = height(node->left); 
+        int rheight = height(node->right); 
+  
+        
+        if (lheight > rheight) 
+            return(lheight+1); 
+        else return(rheight+1); 
+    } 
+}
+
+
+void printGivenLevel(struct node* root, int level) 
+{ 
+    if (root == NULL) 
+        return; 
+    if (level == 1) 
+        printf("%d ", root->data); 
+    else if (level > 1) 
+    { 
+        printGivenLevel(root->left, level-1); 
+        printGivenLevel(root->right, level-1); 
+    } 
+}  
+void levelOrder( struct node *root) 
+{
+    int h = height(root); 
+    int i; 
+    for (i=1; i<=h; i++) 
+        printGivenLevel(root, i); 
+}
+
+//Aditya Seth
+int main() 
+{
+  
+    struct node* root = NULL;
+    
+    int t;
+    int data;
+
+    scanf("%d", &t);
+
+    while(t-- > 0) 
+	{
+        scanf("%d", &data);
+        root = insert(root, data);
+    }
+  
+	levelOrder(root);
+    return 0;
+}
+

23 - BST Level-Order Traversal/Solution.cpp

@@ -0,0 +1,63 @@
+#include <cmath>
+#include <iostream>
+#include <queue>
+
+using namespace std;
+
+class Node {
+public:
+    int data;
+    Node *left, *right;
+
+    Node(int d) {
+        data = d;
+        left = right = NULL;
+    }
+};
+
+class Solution {
+public:
+    Node *insert(Node *root, int data) {
+        if (root == NULL) {
+            return new Node(data);
+        } else {
+            Node *cur;
+            if (data <= root->data) {
+                cur = insert(root->left, data);
+                root->left = cur;
+            } else {
+                cur = insert(root->right, data);
+                root->right = cur;
+            }
+            return root;
+        }
+    }
+
+    void levelOrder(Node *root) {
+        queue<Node *> q;
+        q.push(root);
+
+        while (q.size() != 0) {
+            Node *curr = q.front();
+            q.pop();
+
+            cout << curr->data << " ";
+
+            if (curr->left) q.push(curr->left);
+            if (curr->right) q.push(curr->right);
+        }
+    }
+};
+//Aditya Seth
+int main() {
+    Solution myTree;
+    Node *root = NULL;
+    int T, data;
+    cin >> T;
+    while (T-- > 0) {
+        cin >> data;
+        root = myTree.insert(root, data);
+    }
+    myTree.levelOrder(root);
+    return 0;
+}

23 - BST Level-Order Traversal/Solution.py

@@ -0,0 +1,39 @@
+class Node:
+    def __init__(self, data):
+        self.right = self.left = None
+        self.data = data
+
+
+class Solution:
+    def insert(self, root, data):
+        if root is 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
+
+    def levelOrder(self, root):
+        queue = [root]
+        while len(queue) is not 0:
+            curr = queue[0]
+            queue = queue[1:]
+            print(str(curr.data) + " ", end="")
+
+            if curr.left is not None:
+                queue.append(curr.left)
+            if curr.right is not None:
+                queue.append(curr.right)
+
+#Aditya Seth
+T = int(input())
+myTree = Solution()
+root = None
+for i in range(T):
+    data = int(input())
+    root = myTree.insert(root, data)
+myTree.levelOrder(root)