CODE TRAYS

Search This Blog

DATA STRUCTURES

Get link
Facebook
X
Pinterest
Email
Other Apps

INSERT THE ELEMENT AT BEGINNING OF LINK LIST

INSERT THE ELEMENT AT Nth POSITION 0F LINK LIST

DELETE AT Nth POSITON OF LINK LIST

REVERSE A LINKED LIST

STACK IMPLEMENTATION (ARRAY)

IMPLEMENTATION OF STACK USING LINKED LIST

CHECK FOR BALANCED PARANTHESES

EVALUATION OF POSTFIX EXPRESSION

IMPLEMENTATION OF BINARY SEARCH TREE

FINDING MIN AND MAX IN BINARY SEARCH TREE

FINDING HEIGHT OF BINARY SEARCH TREE

PREORDER TRAVERSAL OF BINARY TREE

Get link
Facebook
X
Pinterest
Email
Other Apps

Comments

Implementation of GREP command in C

#include<stdio.h> #include<string.h> void main(int argc , char *argv[]) { FILE *fp; char line[100]; // initialsing the file pointer to read fp = fopen(argv[2],"r"); // reading line by line and comparing each word in line while(fscanf(fp , "%[^\n]\n" , line)!=EOF) { if(strstr(line , argv[1]) !=NULL) { // print that line ...

Implementation of CAT command in C program

#include<stdio.h> void main(int argc , char *argv[]) { FILE *file; char line[100]; // remember file should exist file = fopen(argv[1],"r"); printf("output of cat command\n"); // reading file line by line entering to buffer line while(fscanf(file,"%[^\n]\n",line)!=EOF) { printf("%s\n", line); ...

Implementation of TAIL command in C

#include<stdio.h> #include<string.h> // creating stack of lines struct stack { char strings[100]; }; void main(int argc , char *argv[]) { // stucture initialisation struct stack s[100]; FILE *file; char line[100]; int n,count=0, i=0; file = fopen(argv[1] , "r"); // reading line by line and push to stack while(fscanf(file , "%[^\n]\n" , line)!=EOF) { ...

Powered by Blogger

All posts by Ravish kg

DATA STRUCTURES

Comments

Post a Comment