آموزش ساختارهای داده - آخرین آپدیت

Basic Data Structures Basic Data Structures

• Arrays Arrays

• Singly Linked Lists Singly-Linked Lists

• Doubly Linked Lists Doubly-Linked Lists

• Stacks Stacks

• Queues Queues

• Trees Trees

• Tree Traversal Tree Traversal

Dynamic Arrays and Amortized Analysis Dynamic Arrays and Amortized Analysis

• Dynamic Arrays Dynamic Arrays

• Amortized Analysis: Aggregate Method Amortized Analysis: Aggregate Method

• Amortized Analysis: Banker's Method Amortized Analysis: Banker's Method

• Amortized Analysis: Physicist's Method Amortized Analysis: Physicist's Method

• Amortized Analysis: Summary Amortized Analysis: Summary

Priority Queues and Disjoint Sets Priority Queues and Disjoint Sets

• Introduction Introduction

• Naive Implementations of Priority Queues Naive Implementations of Priority Queues

• Binary Trees Binary Trees

• Basic Operations Basic Operations

• Complete Binary Trees Complete Binary Trees

• Pseudocode Pseudocode

• Heap Sort Heap Sort

• Building a Heap Building a Heap

• Final Remarks Final Remarks

• Overview Overview

• Naive Implementations Naive Implementations

• Trees for Disjoint Sets Trees for Disjoint Sets

• Union by Rank Union by Rank

• Path Compression Path Compression

• Analysis (Optional) Analysis (Optional)

Hash Tables Hash Tables

• Applications of Hashing Applications of Hashing

• Analysing Service Access Logs Analysing Service Access Logs

• Direct Addressing Direct Addressing

• Hash Functions Hash Functions

• Chaining Chaining

• Chaining Implementation and Analysis Chaining Implementation and Analysis

• Hash Tables Hash Tables

• Phone Book Data Structure Phone Book Data Structure

• Universal Family Universal Family

• Hashing Phone Numbers Hashing Phone Numbers

• Hashing Names Hashing Names

• Analysis of Polynomial Hashing Analysis of Polynomial Hashing

• Find Substring in Text Find Substring in Text

• Rabin Karp's Algorithm Rabin-Karp's Algorithm

• Recurrence for Substring Hashes Recurrence for Substring Hashes

• Improving Running Time Improving Running Time

• Julia's Diary Julia's Diary

• Julia's Bank Julia's Bank

• Blockchain Blockchain

• Merkle Tree Merkle Tree

Binary Search Trees Binary Search Trees

• Introduction Introduction

• Search Trees Search Trees

• Basic Operations Basic Operations

• Balance Balance

• AVL Trees AVL Trees

• AVL Tree Implementation AVL Tree Implementation

• Split and Merge Split and Merge

Binary Search Trees 2 Binary Search Trees 2

• Applications Applications

• Splay Trees: Introduction Splay Trees: Introduction

• Splay Trees: Implementation Splay Trees: Implementation

• (Optional) Splay Trees: Analysis (Optional) Splay Trees: Analysis