Add files via upload

Author: AdityaSeth777

22 - Binary Search Trees/Solution.c

@@ -0,0 +1,55 @@
+#include <stdio.h>
+#include <stdlib.h>
+typedef struct Node{
+    struct Node* left;
+    struct Node* right;
+    int data;
+}Node;
+Node* newNode(int data){
+    Node* node=(Node*)malloc(sizeof(Node));
+    node->left=node->right=NULL;
+    node->data=data;
+    return node;
+}
+
+int getHeight(Node* root){
+    if(!root) {
+        return -1;
+    }
+    int lheight = getHeight(root->left);
+    int rheight = getHeight(root->right);
+
+    return (lheight > rheight ? lheight : rheight) + 1;
+}
+
+
+Node* insert(Node* root,int data){
+    if(root==NULL)
+        return newNode(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;
+}
+//Aditya Seth
+int main(){
+    Node* root=NULL;
+    int T,data;
+    scanf("%d",&T);
+    while(T-->0){
+        scanf("%d",&data);
+        root=insert(root,data);
+    }
+    int height=getHeight(root);
+    printf("%d",height);
+    return 0;
+
+}

22 - Binary Search Trees/Solution.cpp

@@ -0,0 +1,59 @@
+#include <cmath>
+#include <iostream>
+
+using namespace std;
+
+class Node {
+public:
+    int data;
+    Node *left;
+    Node *right;
+
+    Node(int d) {
+        data = d;
+        left = NULL;
+        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;
+        }
+    }
+
+    int getHeight(Node *root) {
+        return root == NULL ? -1 : 1 + max(getHeight(root->left), getHeight(root->right));
+    }
+};
+//Aditya Seth
+int main() {
+    Solution myTree;
+    Node *root = NULL;
+    int t;
+    int data;
+
+    cin >> t;
+
+    while (t-- > 0) {
+        cin >> data;
+        root = myTree.insert(root, data);
+    }
+    int height = myTree.getHeight(root);
+    cout << height;
+
+    return 0;
+}

22 - Binary Search Trees/Solution.py

@@ -0,0 +1,31 @@
+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 getHeight(self, root):
+        return -1 if root is None else 1 + max(self.getHeight(root.left), self.getHeight(root.right))
+
+#Aditya Seth
+T = int(input())
+myTree = Solution()
+root = None
+for i in range(T):
+    data = int(input())
+    root = myTree.insert(root, data)
+height = myTree.getHeight(root)
+print(height)