Data Structures Tutorial

• Interview Questions
• Practice Test
• Pragnyameter Exam
• All Tutorials
• Job Search

What is Data Structure Tutorial?

Data Structures are known as the programmatic way of storing data in an efficient way.Here each and every enterprise application considers different types of data structures in different way. This tutorial provides basic understanding on Data Structures to get in depth knowledge of enterprise level applications and need of algorithms, and data structures.

Audience

This tutorial is targeted for computer Science graduates and Software Professionals who wish to seek data structures and algorithm programming in simple way.

Prerequisites

To learn this tutorial, one must have basic understanding of C programming language, text editor, and execution of programs, etc.

Data Structures Tutorial: List of Topics

• Introduction
  • Data Structure
  • Linked Data Structure
  • Succinct Data Structure
  • Implicit Data Structure
  • Compressed Data Structure
  • Search Data Structure
  • Static And Dynamic Data Structures
  • Persistent Data Structure
  • Concurrent Data Structure
• Abstract Data Types
  • Abstract Data Type
  • List
  • Stack
  • What Is A Queue
  • Deque
  • Priority Queue
  • Map
  • Bidirectional Map
  • Multimap
  • Set
  • Tree
• Arrays
  • Array Data Structure
  • Row- Major Order
  • Dope Vector
  • Iliffe Vector
  • Dynamic Array
  • Hashed Array Tree
  • Gap Buffer
  • Circular Buffer
  • Sparse Array
  • Bit Field
  • Bit Array
  • Bitboard
  • Parallel Array
  • Lookup Table
• Lists
  • Linked List
  • Xor Linked List
  • Unrolled Linked List
  • Vlist
  • Skip List
  • Jump List
  • Self- Organizing List
• Binary Trees
  • Binary Tree
  • Binary Search Tree Data Structure
  • Self- Balancing Binary Search Tree
  • Tree Rotation
  • Weight- Balanced Tree
  • Threaded Binary Tree
  • Avl Tree
  • Red- Black Tree
  • Aa Tree
  • Scapegoat Tree
  • Splay Tree
  • T- Tree
  • Rope
  • Top Trees
  • Tango Trees
  • Van Emde Boas Tree
  • Cartesian Tree
  • Treaps
• B-trees
  • B- Tree
  • B+ Tree
  • B*- Tree
  • B Sharp Tree
  • Dancing Tree
  • 2- 3 Tree
  • 2- 3- 4 Tree
  • Queaps
  • Fusion Tree
  • Bx- Tree
• Heaps
  • Heap
  • Binary Heap
  • Binomial Heap
  • Fibonacci Heap
  • 2- 3 Heap
  • Pairing Heap
  • Beap
  • Leftist Tree
  • Skew Heap
  • Soft Heap
  • Ternary Heap
  • D- Ary Heap
• Tries
  • Trie
  • Radix Tree
  • Suffix Tree
  • Suffix Array
  • Compressed Suffix Array
  • Fm- Index
  • Generalised Suffix Tree
  • B- Trie
  • Judy Array
  • Directed Acyclic Word Graph
• Multiway Trees
  • Ternary Search Tree
  • And–or Tree
  • (a,b)- Tree
  • Link/ Cut Tree
  • Spqr Tree
  • Spaghetti Stack
  • Disjoint- Set Data Structure
• Space-partitioning Trees
  • Space Partitioning
  • Binary Space Partitioning
  • Segment Tree
  • Interval Tree
  • Range Tree
  • Bin
  • Kd- Tree
  • Implicit Kd- Tree
  • Min/ Max Kd- Tree
  • Adaptive K- D Tree
  • Quadtree
  • Octree
  • Linear Octrees
  • Z- Order
  • Ub- Tree
  • R- Tree
  • R+ Tree
  • R* Tree
  • Hilbert R- Tree
  • X- Tree
  • Metric Tree
  • Vp- Tree
  • Bk- Tree
• Hashes
  • Hash Table
  • Hash Function
  • Open Addressing
  • Lazy Deletion
  • Linear Probing
  • Quadratic Probing
  • Double Hashing
  • Cuckoo Hashing
  • Coalesced Hashing
  • Perfect Hash Function
  • Universal Hashing
  • Linear Hashing
  • Extendible Hashing
  • 2- Choice Hashing
  • Pearson Hashing
  • Fowler–noll–vo Hash Function
  • Bitstate Hashing
  • Bloom Filter
  • Locality Preserving Hashing
  • Morton Number
  • Zobrist Hashing
  • Rolling Hash
  • Hash List
  • Hash Tree
  • Prefix Hash Tree
  • Hash Trie
  • Hash Array Mapped Trie
  • Distributed Hash Table
  • Consistent Hashing
  • Stable Hashing
  • Koorde
• Graphs
  • Graph
  • Adjacency List
  • Adjacency Matrix
  • And- Inverter Graph
  • Binary Decision Diagram
  • Binary Moment Diagram
  • Zero Suppressed Decision Diagram
  • Propositional Directed Acyclic Graph
  • Graph- Structured Stack
  • Scene Graph