2. Singly Linked List
Learn in-depth the most fundamental data structure in a programmer's life
3. Doubly Linked List
Learn about the extension of the singly linked list that powers stacks and queues
10. Binary Search Tree
Learn about the most critical search data structure in computer science
What you will learn
Structure, representation and implementation of a queue
Fundamental operations and class design using arrays and linked list
Understand essential patterns behind common interview problems
Detailed code implementation and solution of all problems
Intuition through visual explanation of algorithms
Hands on practical experience in a setup free coding environment
This is a complete course and assumes that you know nothing about queues but are familiar with some basic foundational topics in any programming language.
- Basic knowledge of programming in any language
- Basic knowledge of functions and classes
- Basic knowledge of memory management
- You have completed the singly linked list course
Data structures are used extensively in software development and a queue is the most fundamental of all data structures. Irrespective of the language, framework, or system that you use, you will always be using a queue in some form or the other.
Representation of a queue
This course teaches you the fundamentals of a queue and how it works. It provides you with code implementations and detailed explanations of a queue and its operations in the most intuitive way. We go step by step to explore its various functions which will give you a deep insight into this awesome data structure. This will help you gain a thorough understanding of the most important data structure of all.
This course is an interactive course with high-quality problems and is deeply focused on problem-solving. It bridges the gap between theoretical concepts and common interview problems by providing detailed explanations of the most common interview problems on a queue. This will help you gain confidence and understand how to convert your learning into action. By the end of the course, you will be pretty confident to solve any queue problem thrown at you.
Who this course is for
This course is an all-rounder course and targets a variety of audiences ranging from complete beginners to experienced programmers who want to take their knowledge to the next level. You will greatly benefit from this course if you identify yourself as one of the following
- Non developers who want to start their journey to learn data structures
- Developers who want to get deepest knowledge of queues
- Anyone interested in improving their problem solving skills
- Anyone preparing for programming interviews
2. Array implementation
3. Linked list implementation
4. Pattern: Design
Learn about the data structure that powers CPU and disk scheduling algorithms