makwana-bharat/dsa

Graphical Representation Of DSA Concept Like Stack & Queue ..., Using TurboC and Their Graphic Library.. To Improve Understanding Power and Turn critical learning in enjoyable work

DATA STRUCTURE & ALGORITHMS

GRAPHICAL

if you want to use this repository then following program are only work in TurboC Compiler Because i use Graphics.h & conio.h header files To See which type of graphics i created scroll Bellow Upto Doubly Linked List Section

  -Doubly Linked List
  -Animated Stack

and to use it folowing steps you need to follow..

    -Store WINDOWS.H file into INCLUDE folder..
    -check path of Graphics TC\BGI\ OR TURBOC3\BGI\
    -Pest This path in WINDOWS.H file where TURBOC3\BGI\ writen
    -in TurboC to hold Console use last line as a getch()

Other program Simply download and run anywhere...

  STACK

A Stack is a linear data structure that follows the LIFO (Last-In-First-Out) principle. Stack has one end, whereas the Queue has two ends (front and rear). It contains only one pointer top pointer pointing to the topmost element of the stack. Whenever an element is added in the stack, it is added on the top of the stack, and the element can be deleted only from the stack. In other words, a stack can be defined as a container in which insertion and deletion can be done from the one end known as the top of the stack.

STACK OPERATIONS

    POP
    PUSH
    PEEP
    PEEK

Under Construction 🚧