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 AVLTrees 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 AVLTrees. 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

• AVLTrees

• 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!