Introduction
Understand what data structures are, why they matter and their main types.
๐ Programming Tutorial
Data Structures
A data structure is a specialized format for organizing, storing, and manipulating data on a computer. Data structures are designed to manage and arrange data in a way that enables efficient access and modification. They serve as the building blocks for algorithms and are critical for the design and implementation of software and databases.
Data Structure Tutorial Index
46 Topics๐ Data Structures
Abstract data types
Learn how ADTs describe what a data structure does without defining how.
๐ Linear Data Structures
Linked List Introduction
Learn what a linked list is, its advantages over arrays and its limitations.
Single Linked List
Learn singly linked list operations with algorithms and a C program.
Stacks using Array
Implement a stack using an array: push, pop, peek and a C program.
Stacks using linkedlist
Implement a stack using a linked list with a top pointer.
Queues using array
Implement a queue using an array: enqueue, dequeue and overflow checks.
Queues using linkedlist
Implement a queue using a linked list with a head pointer.
Stack Applications
Explore function calls, recursion and expression notations using stacks.
Infix to Postfic Converstion
Convert infix expressions into postfix notation using a stack.
Postfix Evaluation
Evaluate postfix expressions using an operand stack.
๐ Dictionaries
Introduction to Dictionaries
Learn the characteristics of dictionaries and the ways to implement them.
Linear list representation
Represent a dictionary using a linear list.
Skip list representation
Learn how a skip list gives fast search, insertion and deletion in an ordered dictionary.
#๏ธโฃ Hash Table
Introduction Hash Table
Learn the basics of hash tables and hashing.
Hash functions
Learn the properties of good hash functions and how keys map to indexes.
Collision Resolution
Understand collisions and the techniques used to resolve them.
Separate chaining
Resolve collisions by keeping a chain of items at each slot.
Open addressing
Learn linear probing, quadratic probing and double hashing.
Rehashing
Learn how a hash table is resized and its keys re-inserted.
Extendible hashing
Understand dynamic hashing that grows by splitting buckets.
๐ณ Trees
Introduction to Tree
Learn tree terminology and the basic concepts of hierarchical data.
Binary trees Representation
Learn how binary trees are represented in memory.
Binary tree traversals
Learn inorder, preorder and postorder traversals of a binary tree.
Binary Search Tree
Learn searching, insertion and deletion in a binary search tree.
AVL Tree
Understand self-balancing trees and rotations.
Red Black Tree
Learn the properties and balancing rules of red-black trees.
Splay Tree
Learn how splaying moves recently accessed nodes to the root.
B Tree
Understand multiway search trees used for disk-based storage.
B+ Tree
Learn B+ trees and how they differ from B trees.
Comparison of Trees
Compare the different tree structures side by side.
๐ธ๏ธ Graphs
Introduction to Graph
Learn graph terminology, types and basic concepts.
Graph Representation
Learn adjacency matrix and adjacency list representations.
Breadth-First Search
Traverse a graph level by level using a queue.
Depth-First Search
Traverse a graph as deep as possible using a stack, then backtrack.
โ๏ธ Sorting
Quick Sort
Learn divide-and-conquer sorting using a pivot and partitioning.
Merge Sort
Learn two-way merge sort and its O(n log n) running time.
Heap Sort
Sort using a binary heap with max-heap and min-heap.
๐ Pattern Matching
Introduction to pattern Matching
Learn the basic concepts and common pattern matching algorithms.
Brute force Pattern Matching
Check the pattern at every position of the text.
BoyerโMoore Pattern Matching
Use the bad character table to skip comparisons while matching.
KMP Pattern Matching
Use the failure (LPS) array to avoid re-comparing characters.
๐ค Tries
Introduction to Tries
Learn the trie (prefix tree) for storing strings and fast pattern matching.
Standard Trie
Learn the basic form of a trie and its operations.
Compressed tries
Learn how merging single-child nodes saves space.
Suffix Trie
Learn tries that store all suffixes of a text.
๐
No topics found
Try another search term.
No topics found
Try another search term.