Skip to content

mrnithish/Data_Structure_Implementation_Code

Repository files navigation

Data Structure in C

Overview

This repository contains the C source code for a data structure that performs various operations.

Features

  1. AVL TREE
  2. Binary Search Tree
  3. Circular Queue Array
  4. Circular Queue Linked List
  5. Doubly Linked List
  6. Polynomial Addition
  7. Queue Array
  8. Queue Linked List
  9. Singly Linked List
  10. Stack Array
  11. Stack Linked List

Avl Tree

Operations

   Insert
   Inorder
   Preorder
   Postorder

Binary Search Tree

Operations

  Insert
  Inorder
  Preorder
  Postorder
  Minimum
  Maximum

Cirular Queue Array

Operations

  Enqueue
  Dequeue
  Display

Circular Queue Linked List

Operations

  Enqueue
  Dequeue
  Display

Doubly Linked List

Operations

  Insert
  Insert Position
  Delete
  Display

Polynomial Addition

  It gets the highest degree of the polynomial and then get the coeffiecent of the polynomial.
  It performs the polynomial addition.

Queue Array

Operations

  Enqueue
  Dequeue
  Display

Queue Linked List

Operations

  Enqueue
  Dequeue
  Display

Singly Linked List

Operations

  Insert
  Delete
  Display
  Delete List

Stack Array

Operations

  Push
  Pop
  Display

Stack Linked List

Operations

  Push
  Pop
  Display

To Clone

  git clone https://github.com/mrnithish/Data_Structure_Implementation_Code.git

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages