Please Login To Continue
Comparison between Array and Linked List Based Implementation of Stack
Lesson 4 of 18 • 2 upvotes • 8:23mins
Shaksham Garg
In this lesson, Shaksham discusses the comparison between the implementation of array-based and linked list based stack.
Data Structures and Algorithms - Stacks and Queues
18 lessons • 3h 6m
1
Introduction to Stack
9:01mins
2
Stack: Array Based Implementation
10:05mins
3
Stack: Linked List Based Implementation
11:41mins
4
Comparison between Array and Linked List Based Implementation of Stack
8:23mins
5
Application of Stack: Balanced Expression
10:32mins
6
Algebraic Expression
9:22mins
7
Prefix Expressions Evaluation
9:54mins
8
Infix to Postfix Conversion
10:50mins
9
Postfix Expression Evaluation
10:02mins
10
Stack: Backtracking Problems
11:47mins
11
Recursion: Backtracking Problems
12:33mins
12
Introduction to Queues
10:11mins
13
Pointers Based Implementation of Queue
11:19mins
14
Code for Pointer-Based Implementation of Queue
11:16mins
15
Array-Based Implementation of Queue
10:11mins
16
Code for Array-Based Implementation of the Queue
11:19mins
17
Comparison of Pointer-Based and Array-Based Implementation of the Queue
7:37mins
18
Application of Queues
10:21mins
Crack Programming with Unacademy
Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Daily live classes
Ask doubts
