Data Structures | NeverGpDzy

Below, we provide a detailed introduction to sequential search and binary search in C, with particular attention to key-value pair scenarios. We will cover basic concepts, data structures, implementation methods, and code examples in a systematic manner.

文章

Data Structures 18 - Hash Table

A hash table is a highly efficient data structure primarily used for fast lookup, insertion, and deletion operations. It maps keys to specific positions in the table via a hash function, thereby accelerating data access. Below is a detailed and systematic guide to hash table implementation, covering basic concepts, hash functions, collision resolution methods, and concrete implementation in C.

文章

Data Structures 19 - Sorting

打开「Data Structures 19 - Sorting」查看完整内容与上下文。

文章

Detailed Explanation of Huffman Tree

Introduction to Huffman Trees

文章

Detailed Explanation of Graph DFS and BFS

1. Basic Definitions of Graphs

文章

dijkstra

Detailed Explanation of Dijkstra's Algorithm

文章

Hash Search Algorithm (Linear Probing)

Introduction

文章

Hash Table Quadratic Probing Rehashing Method

1. Overview

文章

Huffman Tree and Huffman Coding

1. Huffman Tree

文章

Merging Two Sorted Singly Linked Lists

Introduction

文章

Minimum Spanning Tree, Prim's Algorithm, Kruskal's Algorithm

打开「Minimum Spanning Tree, Prim's Algorithm, Kruskal's Algorithm」查看完整内容与上下文。

文章

Number of Leaf Nodes in a Complete Binary Tree (Pending Verification)

Calculation Method

文章

Pointer Subtraction Issue

In C, the result of subtracting two pointers represents the number of elements between the two pointers, not the difference in their addresses. This is very useful when working with arrays and pointer operations. Below, I will explain this in detail through two examples: a simple array example and a more complex example involving structs.

文章

Reconstructing a Binary Tree from Traversal Sequences

Preorder, inorder, and postorder traversals of a binary tree are fundamental operations in data structures. Using these traversal sequences, the original binary tree can be uniquely reconstructed. This article provides a detailed explanation of how to reconstruct a binary tree from preorder and inorder traversals, as well as from postorder and inorder traversals, along with corresponding C code implementations.

文章

Recursive Creation of a Binary Tree

1. Binary Tree Definition

文章

Relationship Between Weighted Nodes and Total Nodes in a Huffman Tree

Basic Concepts of Huffman Trees

文章

Detailed Explanation of Topological Sorting

1. Definition

文章