Data-Structures-using-C

Contains code for basic concepts in Data Structures using C language.
HAVE FUN!!!

Array

→Simple array implementation of list

Linked list

→Singly linked list

→Singly linked list-internet reference 1

→Singly linked list-internet reference 2

→Doubly linked list

→Circular linked list

Stack

→Operator precedence using Stack ADT

→Array implementation of stack

→Infix to postfix conversion using stack ADT

→Linked list implementaion of stack

→Parenthesis balanced or not

→Evaluation of postfix expression

→Reverse string using stack ADT

Polynomial

→Addition of two polynomials

→Differentiatiion of two polynomials

→Subtraction of two polynomials

→Polynomial ADT

Queue

→Array implementation of queue

→Linked list implementaion of queue

→Array implementation of circular queue

Tree

→Binary search tree

→AVL tree

Heap

→Max heap

Searching

→Linear search

→Binary search.

Sorting

→Bubble sort

→Insertion sort

→Merge sort

→Quick sort

→Selection sort

→Shell sort

→Topolocial sorting

Hashing

→Hashing_technique

Graph

→Graph representation using adjacency matrix

→Depth first search

→Breath first search