Lec-31: PUSH operation using Array | Implementation of Stack | Data Structure

preview_player
Показать описание

0:00 - Introduction
1:04 -Implementation of Stack
1:08 -Using Array
1:12 -Using Linked List
3:02 -Push Operation using Array
3:24 -Stack Example
5:50 -Push Operation (Pseudocode)
7:56 -Time Complexity O(1)

►Data Structure (Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
►Database Management System:
► Theory of Computation
►Artificial Intelligence:
►Computer Networks (Complete Playlist):
►Computer Architecture (Complete Playlist):
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Design and Analysis of algorithms (DAA) (Complete Playlist):
►Graph Theory:
►Programming in C:
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
  1. Gate Smashers
  2. stack in c programming
  3. stack in data structure
  4. stack program in c using array
  5. what is stack explain with example
  6. stack in c
Рекомендации по теме
Lec-31: PUSH operation 0:08:05

Lec-31: PUSH operation using Array | Implementation of Stack | Data Structure

3.2 Implementation of 0:17:27

3.2 Implementation of Stack using Array | Data Structure and Algorithm Tutorials

Implementation of push()👨‍💻 0:00:51

Implementation of push()👨‍💻

Stack Implementation using 0:00:59

Stack Implementation using Array | Push, Pop, Peek Operations

Lec-32: POP operation 0:07:32

Lec-32: POP operation using Array | Implementation of Stack | Data Structure

1.2 Array Operations 0:28:51

1.2 Array Operations - Traversal, Insertion | Explanation with C Program | DSA Course

4.2 Implementation of 0:23:06

4.2 Implementation of Queue using Arrays | Data Structures & Algorithm Tutorials

Array Implementation of 0:10:00

Array Implementation of Stacks (Part 1)

Implementing Two Stacks 0:06:55

Implementing Two Stacks In One Array

Stack Operations : 0:08:12

Stack Operations : Push and Pop Part 1 Explained in Hindi l Data Structure

Lec-30: Introduction to 0:06:46

Lec-30: Introduction to Stack | PUSH and POP operations | Data Structure

Stack Push Pop 0:00:21

Stack Push Pop Operation Algorithms

stack program |push() 0:00:26

stack program |push() | pop() | show()🥰 in c language .#rkgprograms #shorts #cprogramming

Lec-33: PUSH operation 0:14:29

Lec-33: PUSH operation using Linked List | Implementation of Stack | Data Structure

Stack Implementation using 0:14:53

Stack Implementation using Array | Data Structure

LEC 31|Data Structures| 0:16:56

LEC 31|Data Structures| Stack Using Linked List By Dr.K.Varada Rajkumar

Lec-50: Implementation of 0:13:15

Lec-50: Implementation of Queue using Array | Enqueue() in Queue | Data Structure #gatesmashers

Stack in Data 0:27:55

Stack in Data structure | Stack Implementation using Array C++ | Stack Operations in Data Structure

How to Implement 0:09:58

How to Implement a Stack using an Array

Data Structures & 0:00:10

Data Structures & Algorithms is ♥️ #shorts #ytshorts #entertainment #jennyslectures #viralshorts...

Stack Pop,Deletion,Peek implementation 0:07:52

Stack Pop,Deletion,Peek implementation using Array Lec-03 | Data Structure & Algorithms||CodingZ...

Binary Search Algorithm 0:01:00

Binary Search Algorithm - Simply Explained

Lecture 54: Introduction 0:43:11

Lecture 54: Introduction to Stacks [Theory + Implementation] || C++ Placement Course

DSUC35: Array Implementation 0:09:22

DSUC35: Array Implementation of Stack in C | Stack Representation Using Array | PUSH POP Operation

Комментарии
Автор

Wahh ❤❤❤❤❤❤ thank you so much for updating video's mam ❤❤❤❤ you are the best explainer

beuely
Автор

yra ye madam bolti ktna sweet hain, smjha bhi acha rhi hain . Too good 😍😍

MinalIrfan-yc
Автор

Mam your teaching skills very understandable. thankyou for teaching in such a nice way😊

theDreamer_V
Автор

Ma'am, first of all thanks a lot for making this topic so easy to us...I have one question-> in the second line of the pseudocode, shouldn't it be if(top == max-1) instead of if(top = max-1) since we are
checking the condition of equality here?

souvikmukherjee
Автор

Madam circular link list ka vidoe banaday

erjavaid
Автор

If stack has 6 unit cell memory and all the 6 cells are filled and we have to push element how we can push the element

Mandar_Shinde