Course Hive
Search

Welcome

Sign in or create your account

Continue with Google
or
Stacks and Queues in Data Structures 2022 | Data Structures Tutorial | Learn DS Algo
Play lesson

Data Structures and Algorithms (DSA): Stacks & Queues | Linked Lists | Sorting | Arrays - Stacks and Queues in Data Structures 2022 | Data Structures Tutorial | Learn DS Algo

Master the Art of Data Structures & Algorithms: Crack Coding Interviews with Ease in 2023! Explore Comprehensive Tutorials & Interview Prep on Stacks, Queues, Graphs, and More. Get Ready to Ace FAANG with Expert Guidance from SCALER!

5.0 (2)
17 learners

What you'll learn

Develop proficiency in implementing commonly used data structures such as stacks, queues, and linked lists
Enhance problem-solving skills by applying algorithms to various coding challenges
Understand and optimize time complexity for efficient algorithm performance
Master dynamic programming and graph theory techniques for complex problem-solving

This course includes

  • 389 hours of video
  • Certificate of completion
  • Access on mobile and TV

Summary

Keywords

Full Transcript

Stacks and Queues are important when it comes to Data Structures. In this tutorial, we will be covering the entire (A-Z) of Stacks and Queues. Master Data Structures and Algorithm now: https://bit.ly/3KnRrut 🔹 What are Stacks and Queues in Data Structure and Algorithm? - Stack is a last in first out (lifo) linear data structure. Imagine stack in DS Algo as a pile of blocks. You can remove the block at the top quite easily. But if you have to remove the block at the end of the pile, you have to remove all the other blocks as well. Elements in Stack can be inserted or deleted only from one side. The insertion of an element into a stack is called push operation and the deletion of an element from the stack is called the pop operation. - Queue is a first in first out (fifo) linear data structure. Elements in Queue can only be inserted and deleted from opposite sides. The insertion of an element in Queue is called as en queue operation and the deletion of an element is referred to as a dequeue operation. The following topics are covered in this tutorial: 0:00 - Introduction 1:08 - Stacks & queues in data structure 2:28 - Stack in data structure 49:49 - Queue in data structure 57:32 - Problems on stacks & queues 1:42:33 - Complete queue tutorial 3:28:20 - Dequeue 5:13:50 - Application of queues in trees ---------------------------------------- About Scaler -------------------------------------------------- We are a tech-focused upskilling and reskilling platform catering to tech enthusiasts in universities and working professionals. There are more Scaler graduates working at Amazon than all of the IITs combined! Learn more about Scaler: https://bit.ly/3gjml9a 📌 Follow us on Social and be a part of an amazing tech community📌 👉 Meet like-minded coder folks on Discord - https://discord.com/invite/ejFeksEtTq 👉 Tweets you cannot afford to miss out on - https://twitter.com/scaler_official 👉 Check out student success stories, expert opinions, and live classes on Linkedin - https://www.linkedin.com/school/scalerofficial 👉 Explore value-packed reels, carousels and get access to exclusive updates on Instagram - https://www.instagram.com/scaler_official/ 📢 Be a part of our one of a kind telegram community: https://t.me/Scalercommunity 🔔 Hit that bell icon to get notified of all our new videos 🔔 If you liked this video, please don't forget to like and comment. Never miss out on our exclusive videos to help boost your coding career! Subscribe to Scaler now! https://www.youtube.com/Scaler?sub_confirmation=1 #stacks #queues #datastructures #dsalgo

Course Hive

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Related Courses

FAQs

Course Hive
Download CourseHive
Keep learning anywhere