• Skip to primary navigation
  • Skip to main content
  • Skip to primary sidebar
  • Sql
  • php
  • C program
  • Seo

Codelack.com

  • Home
  • C++
  • networking
  • Sql server
    • what is rdbms | one to one | one to many | many to many relation-codlack
    • sql server create table
    • code rules in sql server
  • ASP.NET
    • control state in asp.net
    • cookie in asp.net
    • datalist control in asp .net
    • Using ASP.NET To Send Email
    • application state in asp.net
    • file upload control in asp.net
  • contact us
  • Data structure
    • what is Data structure
    • doubly linked list program in c
    • Array in data structure
    • circular queue in data structure
    • Linear data structure
    • Delete node at any position in singly linked list
    • dequeue in data structure
    • implementation of stack using a Linked list in data structure
    • implementation of stack using array in data structure
    • linked list algorithm
    • linked list in data structure
  • C
    • continue and break in c
    • history of c programming language
    • array program in c
    • c programming practice questions
    • enumeration in c
    • C programs with solutions
    • Characteristic of c
    • print 1 to 100 without using loop in c program
    • two single dimension 2D array in c
  • php
    • php
    • Variables in PHP
    • Scalar data types in php
    • Output function in php
    • how to use php string functions | example of string function
    • point to point configuration
    • error in php
    • Array in  php

stacks in data structure

Stack in data structure    is a linear data structure in which insertion and deletion can  take place only  at

One end that is known as top of the stack. It is also known as  LIFO system(LIFO  stands for last in first out)

 OR

In  other word a  stack is a homogeneous  collection of item, arranged in linearly with access at one end only called the top.

This means that the data can  be added or removed from only  the top.

OR

Stack is a straight information structure which permits any kind of operations on just top of stack .

Stack fallows specific request just i.e. LIFO( Last In First Out) or FILO(First In Last Out).

Operation of the stack

Different operation

  1. Push operation   — it means insert an item into the stack. includes a thing in the stack. On the off chance that the stack is full, them it is said to be a flood condition.
  2. Pop operation  — it means to delete on item from the stack. expels a thing from the stack. The thing are flown in the switched arrange in which they are pushed. In the event that the stack is void, at that point it is said to be an undercurrent condition.
  3. Peek operation – if one interested only about the information stored at  some location in a stack then peep operation is required. get the thing from stack without pop.
stack_codelack

The most effective method to comprehend a stack for all intents and purposes

There are numerous genuine cases of stack.

Consider the straightforward case of plates stacked more than each other in bottle.

The plate which is at the best is the first to be expelled. i.e. the plate which has been set at the base most position stays in the stack for the longest time frame.

Along these lines, it can be basic seen to take after LIFO/FILO arrange.

how to use stack

A stack can be incremented in two  ways

  • Array implementation
  1. Linked list implementation.

Primary Sidebar

sql

  • introduction of sql
  • database management system
  • hierarchical database management system
  • what is rdbms | one to one | one to many | many to many relation-codlack
  • codd rules in sql server
  • Character Data Type
  • constraint unique
  • sql server create table

Ads

data structure

  • Data structure
  • Linear data structure
  • Array in data structure
  • What is a algorithm
  • stacks in data structure
  • queue data structure
  • dequeue in data structure
  • Priority queue
  • circular queue in data structure
  • linked list algorithm
  • Delete node in singly linked list
  • tree in data structure
  • implementation of stack using array in data structure
  • implementation of stack using a Linked list in data structure
  • Doubly Linked List Implementation

C programming

  • history of c programming language
  • C programs with solutions
  • Characteristic
  • constraint unique
  • continue and break
  • doubly linked list program in c
  • dynamic memory allocation
  • enumeration
  • print 1 to 100 without using loop
  • Variable declaration

c++

  • Introduction to C++ | similarities of  C++ structure and  class
  • default argument in c++
  • access specifiers in c++
  • Function In C++
  • friend function in c++
  • constructor in c++
  • destructor in c++ | How to call destructor C++
  • exception handling in c++

Categories

array multiplication (1) asp.net (10) B.ed (1) C# (1) c# (1) C++ (2) C program (3) FormView control (1) php (2) Seo (5) Sql (1) Uncategorized (12)
disclaimer

Copyright © 2022 · codelack.com