Back To Module Home

Data Structures in Java

0% completed

Complexity Measures

Comparing Algorithms Example: Measuring Time Complexity of a Single Loop Algorithm Example: Time Complexity of an Algorithm With Nested Loops Introduction to Asymptotic Analysis and Big O Other Common Asymptotic Notations and Why Big O Trumps Them Useful Formulae Common Complexity Scenarios

Arrays

What is an Array?Two Dimensional Arrays

Linked Lists

What is the Singly Linked List (SLL)?Basic Linked List Operations Insertion in a Singly Linked List Insertion in Singly Linked List (Insert After)Singly Linked List Deletion (Implementation)Linked Lists vs. Arrays What is a Doubly Linked List (DLL)?Linked List with Tail

Stack/Queues

What is a Stack?Stack (Implementation)What is a Queue?Queue (Implementation)

Trees

What is a Tree?Types of Trees What Makes a Tree Balanced?What is a Binary Tree?More on Complete Binary Trees Skewed Binary Tree What is a Binary Search Tree (BST)?Insertion in Binary Search Trees Insertion in BST (Complete Implementation)Search in Binary Search Trees (Implementation)Deletion in Binary Search Trees Deletion in Binary Search Trees (Implementation)Pre-Order Traversal in Binary Search Trees In-Order Traversal in Binary Search Trees Post-Order Traversal in Binary Search Tree What is an AVL Tree?AVL Insertion AVL Deletion What is a Red-Black Tree?Red-Black Tree Insertion Red-Black Tree Deletion What is a 2-3 Tree?2-3 Insertion 2-3 Deletion of Element at Leaf Node 2-3 Deletion of Element at Internal Node 2-3-4 Trees

Graphs

What is a Graph?Representation of Graphs Graph Implementation Complexities of Graph Operations What is a Bipartite Graph?Graph Traversal Algorithms

Heaps

What is a Heap Why Use Heaps?Heap Representation in Arrays Max Heap: Introduction Max Heap (Implementation)Min Heap: An Introduction Min Heap (Implementation)

Hash Tables

What is a Hash Table?Hash Functions Collisions in Hash Tables Building a Hash Table from Scratch Add/Remove & Search in a Hash Table (Implementation)Complete Implementation of Hash Tables Trie vs Hash Table HashMap vs HashSet

Conclusion

...

/

Final Remarks

Final Remarks

Here’s a quick summary of what we learned from the ‘‘Data Structures in Java’’ module.

Congratulations! You have successfully completed the “Data Structures in Java” module.

Summary

In this module, we started with single and ...