diff --git a/codes/binary_tree.cpp b/codes/binary_tree.cpp
new file mode 100644
index 0000000..cdb4108
--- /dev/null
+++ b/codes/binary_tree.cpp
@@ -0,0 +1,206 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+struct node{
+	int key;
+	node *left;
+	node* right;
+	node* parent;
+};
+
+struct node_avl
+{
+	int key;
+	int balance;
+	node_avl *left;
+	node_avl *right;
+	node_avl *parent;
+};
+
+node * insert_tree(node *n,int a)
+{
+	if(n==NULL)
+	{
+		node *temp;
+		temp = new node;
+		temp->key = a;
+		temp->left = NULL;
+		temp->right = NULL;
+		temp->parent = NULL;
+		return temp;
+	}
+	else if(a < n->key)
+		n->left = insert_tree(n->left,a);
+	else
+		n->right = insert_tree(n->right,a);
+	
+	return n;
+}
+
+node * delete_tree(node *root,int a)
+{
+	if(root->key < a)
+	{
+		root->right = delete_tree(root->right,a);
+	}
+	else if(root->key > a)
+	{
+		root->left = delete_tree(root->left,a);
+	}
+	else
+	{
+		if(root->left == NULL)
+		{
+			node *temp;
+			temp = root->right;
+			free(root);
+			return temp;
+		}
+		else if(root->right == NULL)
+		{
+			node *temp;
+			temp = root->left;
+			free(root);
+			return temp;
+		}
+		else
+		{
+			node *temp;
+			temp = root;
+			temp = temp->right;
+
+			while(temp->left!=NULL)
+			{
+				temp = temp->left;
+			}
+
+			root->key = temp->key;
+
+			root->right = delete_tree(root->right,temp->key);
+		}
+	}
+
+	return root;
+}
+
+node_avl *insert_avl(node *root,int a)
+{
+	if(root==NULL)
+	{
+		node_avl *temp;
+		temp = new node_avl;
+		temp->key = a;
+		temp->balance = 0;
+		temp->right = NULL;
+		temp->left = NULL;
+		temp->parent = root;
+		return temp;
+	}
+	if(a < root->key)
+	{
+		if(root->left == NULL)
+		{
+			node_avl *temp;
+			temp = new node_avl;
+			temp->key = a;
+			temp->balance = 0;
+			temp->right = NULL;
+			temp->left = NULL;
+			temp->parent = root;
+
+			while(temp1!=NULL)
+			{
+				if(a < temp1->key)
+				{
+					if(temp1->balance == 1)
+					{
+						temp1->balance = 0;
+						break;
+					}
+					else if(temp1->balance == 0)
+					{
+						temp1->balance = -1;
+					}
+					else
+					{
+						// rotate right
+					}
+				}
+				else
+				{
+					if(temp1->balance == -1)
+					{
+						temp1->balance = 0;
+						break;
+					}
+					else if(temp1->balance == 0)
+					{
+						temp1->balance = 1;
+					}
+					else
+					{
+						// rotate left
+					}
+				}
+			
+		}
+		else
+		{
+			root->left = insert_avl(root->left,a);
+		}
+	}
+	else
+	{
+		if(root->right == NULL)
+		{
+			node_avl *temp;
+			temp = new node_avl;
+			temp->key = a;
+			temp->balance = 0;
+			temp->right = NULL;
+			temp->left = NULL;
+			temp->parent = root;
+		}
+		else
+		{
+			root->right - insert_avl(root->right,a);
+		}
+	}
+}
+
+void inorder(node *root)
+{
+	if(root == NULL)
+		return;
+
+	inorder(root->left);
+	cout<<root->key<<endl;
+	inorder(root->right);
+}
+
+int main()
+{
+	int n;
+	cout<<"No. of nodes : ";
+	cin>>n;
+
+	cout<<"enter key values "<<endl;
+
+	node *root;
+	root = NULL;
+
+	for(int i=0;i<n;i++)
+	{
+		int new_node;
+		cin>>new_node;
+
+		root = insert_tree(root,new_node);
+	}	
+
+	inorder(root);
+
+	root = delete_tree(root,2);
+
+	inorder(root);
+
+}
\ No newline at end of file
diff --git a/codes/kmp_algo.cpp b/codes/kmp_algo.cpp
new file mode 100644
index 0000000..83dab5e
--- /dev/null
+++ b/codes/kmp_algo.cpp
@@ -0,0 +1,77 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+void compute_lps(int *lps,string pat)
+{
+	int prev =0;
+	int i=1;
+	lps[0] = 0;
+
+	while(i<pat.size())
+	{
+		if(pat[prev]==pat[i])
+		{
+			prev++;
+			lps[i] = prev;
+			i++;
+		}
+		else
+		{
+			if(prev == 0)
+			{
+				lps[i]=0;
+				i++;
+			}
+			else
+			{
+				prev = lps[prev-1];
+			}
+		}
+	}
+}
+
+void KMP_search(string pat,string s)
+{
+	int lps[pat.size()];
+	compute_lps(lps,pat);	
+	int i=0;
+	int j=0;
+
+	while(i<s.size())
+	{
+		cout<<"i: "<<i<<" j: "<<j<<endl;
+		if(pat[j]==s[i])
+		{
+			i++;
+			j++;
+		}
+		else
+		{
+			if(j==0)
+				i++;
+			else
+				j = lps[j-1];
+		}
+
+		if(j==pat.size())
+		{
+			cout<<"Matched at index : "<<i<<endl;
+			j= lps[j-1];
+		}
+	}
+}
+
+int main()
+{
+	string a;
+	a = "ABABDABACDABABCABAB";
+	string pat;
+	pat = "ABABCABAB";
+
+	int A[pat.size()];
+	compute_lps(A,pat);
+
+	cout<<A[pat.size()-1]<<endl;
+
+	KMP_search(pat,a);
+}
\ No newline at end of file
diff --git a/codes/kruskal_algo_linkedlist.cpp b/codes/kruskal_algo_linkedlist.cpp
new file mode 100644
index 0000000..d86649a
--- /dev/null
+++ b/codes/kruskal_algo_linkedlist.cpp
@@ -0,0 +1,155 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+struct node_
+{
+	int len;
+	node_ *next;
+	node_ *head;
+	int key;
+	node_ *tail;
+};
+
+struct edge
+{
+	int first;
+	int second;
+	int w;
+};
+
+void merge(edge *E,int from, int to)
+{
+	int n;
+	n = to-from+1;
+	edge A[n];
+	for(int i=0;i<n;i++)
+	{
+		A[i] = E[from+i]; 
+	}
+
+	int i,j;
+	i=0;
+	j= (n%2==0)? (n/2) : (n/2)+1;
+	int count=from,mid=j;
+
+	while(i!=mid && j!=(n))
+	{
+		if(A[i].w < A[j].w)
+		{
+			E[count++] = A[i];
+			i++;
+		}
+		else
+		{
+			E[count++] = A[j];
+			j++;
+		}
+	}
+
+
+	if(i==mid)
+	{
+		while(j!=(n))
+		{
+			E[count++] = A[j];
+			j++;
+		}
+	}
+	else 
+	{
+		while(i!=mid)
+		{
+			E[count++] = A[i];
+			i++;
+		}
+	}
+
+}
+
+void merge_sort(edge *E,int from,int to)
+{
+	if(to == from)
+		return;
+
+	merge_sort(E,from, (from+to)/2);
+	merge_sort(E,(from+to)/2 +1,to);
+	merge(E,from,to);
+}
+
+void union_set(node_ *A,node_ *B)
+{
+	node_ *temp = NULL;
+
+	if(A->len > B->len)
+	{
+		(A->tail)->next = B;
+		(A->tail) = B->tail;
+		A->len += B->len;
+
+		temp = B;
+		while(temp!=NULL)
+		{
+			temp->head = A;
+			temp = temp->next;
+		} 
+	}
+	else
+	{
+		(B->tail)->next = A;
+		(A->tail) = A->tail;
+		B->len += A->len;
+
+		temp = A;
+		while(temp!=NULL)
+		{
+			temp->head = B;
+			temp = temp->next;
+		}
+	}
+}
+
+int main()
+{
+	int n,e;
+	cout<<"No. of Nodes and no. of edges"<<endl;
+	cin>>n>>e;
+
+	cout<<"Describe edges : from to weight"<<endl;
+
+	edge E[e];
+
+	for (int i = 0; i < e; ++i)
+	{
+		cin>>E[i].first>>E[i].second>>E[i].w;
+	}
+
+	merge_sort(E,0,e-1);
+
+	// 
+
+	node_ N[n];
+
+	for (int i = 0; i < n; ++i)
+	{
+		N[i].next = NULL;
+		N[i].head = &N[i];
+		N[i].key = i;
+		N[i].len = 1;
+		N[i].tail = &N[i];
+	}
+
+	for(int i=0;i<e;i++)
+	{
+		int a,b;
+		a = (N[E[i].first].head)->key;
+		b = (N[E[i].second].head)->key;
+
+		if(a!=b)
+		{
+			cout<<E[i].first<<" "<<E[i].second<<endl;
+			union_set(&N[a],&N[b]);
+		}
+	}
+
+
+}
\ No newline at end of file
diff --git a/codes/kruskal_algo_tree.cpp b/codes/kruskal_algo_tree.cpp
new file mode 100644
index 0000000..cb06c7a
--- /dev/null
+++ b/codes/kruskal_algo_tree.cpp
@@ -0,0 +1,147 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+struct edge
+{
+	int first;
+	int second;
+	int w;
+};
+
+struct node_
+{
+	node_ *parent;
+	int key;
+	int height;
+};
+
+void merge(edge *E,int from, int to)
+{
+	int n;
+	n = to-from+1;
+	edge A[n];
+	for(int i=0;i<n;i++)
+	{
+		A[i] = E[from+i]; 
+	}
+
+	int i,j;
+	i=0;
+	j= (n%2==0)? (n/2) : (n/2)+1;
+	int count=from,mid=j;
+
+	while(i!=mid && j!=(n))
+	{
+		if(A[i].w < A[j].w)
+		{
+			E[count++] = A[i];
+			i++;
+		}
+		else
+		{
+			E[count++] = A[j];
+			j++;
+		}
+	}
+
+
+	if(i==mid)
+	{
+		while(j!=(n))
+		{
+			E[count++] = A[j];
+			j++;
+		}
+	}
+	else 
+	{
+		while(i!=mid)
+		{
+			E[count++] = A[i];
+			i++;
+		}
+	}
+
+}
+
+void merge_sort(edge *E,int from,int to)
+{
+	if(to == from)
+		return;
+
+	merge_sort(E,from, (from+to)/2);
+	merge_sort(E,(from+to)/2 +1,to);
+	merge(E,from,to);
+}
+
+int find_set(node_ E)
+{
+	while((E.parent)->key != E.key)
+	{
+		E = *(E.parent);
+	}
+
+	return E.key;
+}
+
+void union_set(node_ *A, node_ *B)
+{
+	if(A->height > B->height)
+	{
+		B->parent = A;
+	}
+	else if(A->height < B->height)
+	{
+		A->parent = B;
+	}
+	else
+	{
+		A->parent = B;
+		(B->height)++;
+	}
+}
+
+int main()
+{
+	int n,e;
+	cout<<"No. of Nodes and no. of edges"<<endl;
+	cin>>n>>e;
+
+	cout<<"Describe edges : from to weight"<<endl;
+
+	edge E[e];
+
+	for (int i = 0; i < e; ++i)
+	{
+		cin>>E[i].first>>E[i].second>>E[i].w;
+	}
+
+	merge_sort(E,0,e-1);
+
+	// 
+
+	node_ N[n];
+
+	for(int i=0;i<n;i++)
+	{
+		N[i].parent = &N[i];
+		N[i].key = i;
+		N[i].height = 1;
+	}
+
+	for(int i=0;i<e;i++)
+	{
+		int a,b; 
+		a = find_set(N[E[i].first]);
+		b = find_set(N[E[i].second]);
+
+		if(a!=b)
+		{
+			cout<<E[i].first<<" "<<E[i].second<<endl;
+			union_set(&N[a],&N[b]);
+		}
+	}
+
+
+
+}
\ No newline at end of file
diff --git a/codes/prims_algo.cpp b/codes/prims_algo.cpp
new file mode 100644
index 0000000..41629ae
--- /dev/null
+++ b/codes/prims_algo.cpp
@@ -0,0 +1,88 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main()
+{
+	int n,e;
+	cout<<"No. of Nodes and no. of edges"<<endl;
+	cin>>n>>e;
+
+	cout<<"Describe edges : from to weight"<<endl;
+
+	int adjmat[n][n];
+	memset(adjmat,0,sizeof(adjmat));
+	int weight[n][n];
+	memset(weight,INT_MAX,sizeof(weight));
+
+	for (int i = 0; i < e; ++i)
+	{
+		int a,b,w;
+		cin>>a>>b>>w;
+		adjmat[a][b] = 1;
+		adjmat[b][a] = 1;
+		weight[a][b] = w;
+		weight[b][a] = w;
+	}
+
+	bool inP[n];
+
+	int shortest_d_to_P[n];
+	int parent[n];
+
+	for(int i=0;i<n;i++)
+	{
+		shortest_d_to_P[i] = INT_MAX;
+		inP[i] = false;
+	}
+
+	inP[0] = true;
+
+	for (int i = 1; i < n; ++i)
+	{
+		if(adjmat[0][i]==1)
+		{
+			shortest_d_to_P[i] = weight[0][i];
+			parent[i] = 0;
+			// cout<<i<<" "<<shortest_d_to_P[i]<<endl;
+
+		}
+	}
+
+	for(int i=0;i<(n-1);i++)
+	{
+		int min_index,min_w=INT_MAX;
+		for(int j=0;j<n;j++)
+		{
+			if(inP[j]==false)
+			{
+				if(shortest_d_to_P[j]<min_w)
+				{
+					min_w = shortest_d_to_P[j];
+					// cout<<j<<" : "<<shortest_d_to_P[j]<<endl;
+					min_index = j;
+				}
+			}
+		}
+
+		// cout<<min_index<<endl;
+
+		inP[min_index] = true;
+		cout<<min_index<<" "<<parent[min_index]<<endl;
+
+		for(int j=0;j<n;j++)
+		{
+			if(inP[j] == false)
+			{
+				if( adjmat[min_index][j] == 1 && (weight[min_index][j] < shortest_d_to_P[j]))
+				{
+					shortest_d_to_P[j] = weight[min_index][j];
+					parent[j] = min_index;
+				}
+			}
+		}
+
+	}
+
+
+}
\ No newline at end of file