From 768e57f4152439ed1a0072015d8a075e20b6743b Mon Sep 17 00:00:00 2001
From: Shivendra k jha <47923680+skjha1@users.noreply.github.com>
Date: Tue, 22 Sep 2020 12:01:16 +0530
Subject: [PATCH] Add files via upload

---
 Tree/BST/03 Insert in BST.c | 173 ++++++++++++++++++++++++++++++++++++
 1 file changed, 173 insertions(+)
 create mode 100644 Tree/BST/03 Insert in BST.c

diff --git a/Tree/BST/03 Insert in BST.c b/Tree/BST/03 Insert in BST.c
new file mode 100644
index 0000000..4f1e914
--- /dev/null
+++ b/Tree/BST/03 Insert in BST.c	
@@ -0,0 +1,173 @@
+#include <stdio.h>
+
+#include <stdlib.h>
+
+struct Node // this is structure for bnary search tree
+
+{
+
+	struct Node* lchild;
+
+	int data;
+
+	struct Node* rchild;
+
+}*root = NULL;
+
+void Insert(int key) // key value to be inserted
+
+{
+
+	struct Node* t = root; // set a temp variable pointer to the root
+
+	struct Node* r=t, * p; // r will follow t // p for creating a new node
+
+	if (root == NULL)
+
+	{
+
+		p = (struct Node*)malloc(sizeof(struct Node)); // creating a new node in heap memory for inserting new data
+
+		p->data = key; // assign the p's data part with key value
+
+		p->lchild = p->rchild = NULL; // set left and right as null initilally
+
+		root = p; // and again root should point on new node
+
+		return;
+
+	}
+
+
+
+	// now take a loop so that we can repeat the steps upto t becomes null so
+
+	while (t != NULL)
+
+	{
+
+		r = t;
+
+		if (key < t->data)
+
+			t = t->lchild; // move t upon left child
+
+		else if (key > t->data)
+
+			t = t->rchild; // move t upon right child
+
+		else
+
+			return;
+
+
+
+	}
+
+	// creating node for insering element
+
+	p = (struct Node*)malloc(sizeof(struct Node)); // creating a new node in heap memory for inserting new data
+
+	p->data = key; // assign the p's data part with key value
+
+	p->lchild = p->rchild = NULL; // set left and right as null
+
+	// linking node to existing tree
+
+	if (key < r->data) // error here
+
+		r->lchild = p; // linking newly created node as left child of tree
+
+	else
+
+		r->rchild = p;// linking newly created node as right child of tree
+
+
+
+
+
+}
+
+// function for inorder traversal
+
+void Inorder(struct Node* p)
+
+{
+
+	if (p != NULL)
+
+	{
+
+		Inorder(p->lchild);
+
+		printf("%d ", p->data);
+
+		Inorder(p->rchild);
+
+	}
+
+}
+
+struct Node* Search(int key)
+
+{
+
+	struct Node* t = root;
+
+	while (t != NULL)
+
+	{
+
+		if (key == t->data)
+
+			return t;
+
+		else if (key < t->data)
+
+			t = t->lchild;
+
+		else
+
+			t = t->rchild;
+
+	}
+
+	return NULL;
+
+}
+
+int main()
+
+{
+
+	struct Node* temp;
+
+	Insert(10);
+
+	Insert(5);
+
+	Insert(20);
+
+	Insert(8);
+
+	Insert(30);
+
+
+
+	Inorder(root);
+
+	printf("\n");
+
+	temp = Search(20);
+
+	if (temp != NULL)
+
+		printf("element %d is found \n", temp->data);
+
+	else
+
+		printf("Element is not found");
+
+	return 0;
+
+}