Data Structures & Algorithms in Java: Working with Stacks
Java
| Intermediate
- 13 videos | 1h 28m 38s
- Includes Assessment
- Earns a Badge
The stack in Java allows us to access data in a last in, first out manner and in the best case scenario, both of these operations are performed in constant time. In this course, you'll get started by examining the behavior and characteristics of the stack data structure. The stack is often referred to as LIFO - or last in, first out - since the last element that you push on to a stack is the first element that you access. You'll learn how you can implement the stack data structure using arrays and linked lists and how to assess the trade-offs between these two implementations. Lastly, you'll see how to write code to perform common operations on a stack such as push(), pop(), and peek() and how to assess the running time for each of these operations.
WHAT YOU WILL LEARN
-
Discover the key concepts covered in this courseRecall the basic characteristics of the stack data structurePerform simple operations on a stack implemented using arraysPush new elements on to a stack implemented using arraysPop elements from a stack implemented using arraysPeek into a stack implemented using arraysPush new elements on to a stack implemented using linked lists
-
Pop elements from and peek into a stack implemented using linked listsSet up the basic interface for the command objectImplement undo using stacks and the command objectCheck for well formed arithmetic expressions using stacksFind the minimum element in constant time in a stackSummarize the key concepts covered in this course
IN THIS COURSE
-
1m 59s
-
10m 7sAfter completing this video, you will be able to recall the basic characteristics of the stack data structure. FREE ACCESS
-
6m 52sIn this video, you will learn how to perform simple operations on a stack implemented using an array. FREE ACCESS
-
4m 37sTo push a new element on to a stack implemented using arrays, you need to... FREE ACCESS
-
8m 21sIn this video, find out how to remove elements from a stack implemented using arrays. FREE ACCESS
-
3m 57sFind out how to peek into a stack implemented using arrays. FREE ACCESS
-
9m 8sIn this video, you will push new elements onto a stack implemented using linked lists. FREE ACCESS
-
6m 14sFind out how to pop elements from and peek into a stack implemented using a linked list. FREE ACCESS
-
5m 56sIn this video, you will learn how to set up the basic interface for the Command object. FREE ACCESS
-
9m 14sIn this video, find out how to implement undo using stacks and the Command object. FREE ACCESS
-
10m 29sIn this video, find out how to check for well-formed arithmetic expressions using stacks. FREE ACCESS
-
10m 6sIn this video, you will learn how to find the minimum element in a stack in constant time. FREE ACCESS
-
1m 36s
EARN A DIGITAL BADGE WHEN YOU COMPLETE THIS COURSE
Skillsoft is providing you the opportunity to earn a digital badge upon successful completion on some of our courses, which can be shared on any social network or business platform.
Digital badges are yours to keep, forever.