Useful Links
Computer Science
Algorithms and Data Structures
Data Structures
1. Introduction to Data Structures and Algorithms
2. Linear Data Structures
3. Hierarchical Data Structures
4. Hash-based Data Structures
5. Graph Data Structures
6. Advanced Data Structures
7. Practical Application and Selection
Advanced Data Structures
Tries
Structure and Properties
Node Structure
Character-based Branching
Core Operations
Insertion Operation
Search Operation
Deletion Operation
Prefix Search
Complexity Analysis
Space Complexity
Time Complexity
Applications
Autocomplete Systems
Spell Checkers
IP Routing Tables
Disjoint Set Union
Core Operations
Find Operation
Union Operation
Optimization Techniques
Union by Rank
Union by Size
Path Compression
Applications
Connected Components in Graphs
Kruskal's Algorithm Support
Segment Trees
Purpose and Use Cases
Range Sum Queries
Range Minimum Queries
Range Maximum Queries
Structure and Construction
Tree Representation
Building Process
Operations
Range Query Operation
Point Update Operation
Range Update Operation
Lazy Propagation
Complexity Analysis
Time Complexity
Space Complexity
Applications
Interval Problems
Dynamic Array Queries
Fenwick Trees
Purpose
Prefix Sum Queries
Structure and Operations
Tree Representation
Point Update Operation
Prefix Query Operation
Complexity Analysis
Time Complexity
Space Complexity
Segment Trees vs Fenwick Trees Comparison
Applications
Cumulative Frequency Tables
Previous
5. Graph Data Structures
Go to top
Next
7. Practical Application and Selection