Data Structures 2022 Clearly Explained Beginner to Advanced

Includes Stacks, Queues, and Basic Trees to Red-Black Trees, AVL Trees, and Graphs coded in Java

In this course we’ll go over Data Structures for Java with explanations, examples, and then finally coding them.  We will start with simple Data Structures such as Stacks and Queues, and gradually move to more advanced topics such as Splay Trees and AVL Trees to Graphs.

What you’ll learn

  • A Complete Understanding of Data Structures in Java.
  • Explaining through organized presentations and examples.
  • We will translate your understanding of Data Structures through the explanations and examples to Code.
  • Beginner and Advanced Data Structures will be taught.

Course Content

  • Introduction –> 3 lectures • 2min.
  • Arrays –> 5 lectures • 33min.
  • Linked Lists –> 7 lectures • 35min.
  • Stacks –> 3 lectures • 12min.
  • Queues –> 4 lectures • 24min.
  • Trees –> 11 lectures • 45min.
  • Heaps –> 4 lectures • 27min.
  • Balanceable Tree –> 5 lectures • 26min.
  • Skip List –> 5 lectures • 27min.
  • AVL Tree –> 5 lectures • 25min.
  • Splay Tree –> 5 lectures • 12min.
  • Red Black Tree –> 10 lectures • 41min.
  • Graphs –> 7 lectures • 29min.

Data Structures 2022 Clearly Explained Beginner to Advanced

Requirements

  • Beginner Java programming experience needed. You will learn to code the Data Structures through Java..

In this course we’ll go over Data Structures for Java with explanations, examples, and then finally coding them.  We will start with simple Data Structures such as Stacks and Queues, and gradually move to more advanced topics such as Splay Trees and AVL Trees to Graphs.

We will help you from a beginner understanding of how these Data Structures work or if you have some knowledge already, this course will supplement and even give you better ideas through examples and a structured presentation.  If you need help with Interviews with more knowledge of Data Structures, this course will help.

There are some coding exercises which are derived from Interview Questions and help understanding how Data Structures can be used to solve problems.

We provide examples for Tree Data Structures as they can be tricky, for instance with AVL Trees.  Learning Balanceable Tree structures can be confusing, but we will alleviate any confusion with examples and organized presentations.

Here is what you will be learning:

 

  • Arrays
  • 2D Arrays
  • Stacks
  • Queues (Deques, Circular)
  • Linked Lists (Singly, Doubly and Circularly)
  • Binary Trees
  • Binary Search Trees
  • Tree Traversals
  • Heap (Min-Heap)
  • Skip List
  • AVL Trees
  • Splay Trees
  • Red-Black Trees
  • Graphs

By the end of this  course, you will understand how these Data Structures work and will have running code to test them!

Get Tutorial