Tree traversal (preorder,inorder,postorder) using linklist (c++)

#include<iostream> using namespace std; struct node {     int data;     struct node *left;     struct node *right; }; /**********Element insertion*****************/ node* insert(node *root,int data) {     if(root==NULL)     {         root=new node();         root->data=data;         root->left=root->right=NULL;  ...

Read More

Implementation of queue using linklist (C++)

#include<iostream> using namespace std; struct queue {     int data;     struct queue *next; };  queue *front=NULL;  queue *rear=NULL;     int count=0; /**********Inserting Element in Queue******************/ void enqueue(int x) {   queue *temp;   temp=new queue();   temp->data=x;   temp->next=NULL;   if(front==NULL && rear==NULL)   {      ...

Read More

Circular queue using array(insertion, deletion)

#include <iostream> using namespace std; int Q[10]; int size=10; int count=0; int rear=0; int front=0; void enQ(int element) {    if(count==size)    {        cout<<"Queue Overflow"<<endl;    }    else    {        Q[rear]=element;        rear=(rear+1)%size;        count++;  ...

Read More

Doubly Linklist (insertion,deletion of a node)

#include <iostream>using namespace std;struct node2{    int data2;    struct node2 *previous;    struct node2 *next2;};int main(){    node2 *head2;    node2 *last2;    node2 *temp2;    last2=0;    int choice;    do    {    cout<<"Enter data in Doubly node:"<<endl;    temp2=new node2();    cin>>temp2->data2; ...

Read More

Singly Linklist in C++ (insertion at satart,middle and end. Searching in linklist. Deletion of any node)

#include <iostream> using namespace std; struct node {     int data;     struct node *next; }; int main() {     node *head;     node *temp;     node *last;     last=0;     int choice;    do     {         temp=new node();         cout<<"Enter values in a node:"<<endl;        ...

Read More

Binary Search in C++

#include <iostream>using namespace std; void binarysearch(int arr[],int s,int size);void binarysearch(int arr[],int s,int size){    int lower=0,higher=size-1,m;    while(lower<=higher)    {        m=(lower+higher)/2;        if(s==arr[m])        {        cout<<"Search...

Read More

Selection sorting Dynamically

Worst-Complexity: n ^ 2 Average-Complexity: n ^ 2 Best-Complexity: n ^ 2 Space-Complexity:  1 #include<iostream> using namespace std; /*********************sorting function********************/ void selection_Sort(int arr[], int n){    int i, j, min;    for (i = 0; i < n-1; i++)    {        min = i;        for (j = i+1; j...

Read More

"Infix to Post-fix" conversion and "parenthesis check using "User define" stacks C++

#include<iostream> using namespace std; char stack[100]; // char postfix[100]; char exp[100]; // mathematical expression entered by the user int top=-1; /**********************************************/ void push1(char newitem) {                 if(top=='\0')                 {                                ...

Read More

A Program which uses linear searching? C++

Starts from the base index and compare it with the rest of the element of an array. If the serached index found, it returns 1 else it returns -1. #include<iostream> using namespace std; /********************************************/ int linearSearch(int n[],int s,int size)     {         for(int i=0;i<size;i++)         {            ...

Read More

Implementation of "STACKS" using arrrays (Data structure)

#include <iostream> #include <cstdlib> using namespace std; int stackarr[5]; int size=5; int top=-1; /***************************************************/ void push(int item) {     if(top==size-1)     {         cout<<"\n Stack is Overflow:"<<endl;     }     else     {         top++;         stackarr[top]=item;  ...

Read More

Quick sorting program

Worse case performance: O(n^2) Best case performance: O(nlogn) Average performance: O(nlogn) #include <iostream> void quicksort(int arr[],int low,int high); int partition(int arr[],int low,int high); using namespace std; /***********************************/ int partition(int arr[],int low,int high) {     int pivot,i;     pivot=arr[high];     i=low-1;     for(int j=low; j<high; j++)    ...

Read More

Merge sorting program in C++

#include <iostream> using namespace std; /****************************************************************************************************/ void merg(int *arr,int first,int last) {     int mid=(first+last)/2;  int i=first;  int j=mid+1;  int k=first;  int temp[100];     while(i<=mid && j<=last)     {         if(arr[i]<arr[j])      ...

Read More

Insertion sorting using pointers and function

Normal 0 false false false EN-US X-NONE X-NONE ...

Read More