Tag: Data Structure
[Data Structure] Data Structure Overview
[Preface] Data structure as a basic knowledge for The importance of a good IT person is self-evident, but many friends feel that its content is difficult and much more difficult. Below we strive t
[Data Structure] Stack Surface Test – Two queues implement a stack
The last article wrote about using two stacks to implement a queue. This article implements using two queues to implement a stack. In fact, the ideas of both almost the same.
Continue drawing
[Data Structure] Creation and Traverse of Binary Trees
#include #include #include #include #define OK 1#define ERROR 0#define TRUE 1#define FALSE 0#define MAXSIZE 100 /* Initial allocation of storage space*/typedef int Status;typedef char TElemType; /*
[Data Structure] The rotation and insertion of the AVL tree
AVL tree
Left single rotation
Code implementation
void _RotateL(Node* parent) {Node* subR=parent->_right; Node* subRL=subR->_left; Node* ppNode=parent- >_parent; subR->_left=paren
[Data Structure] Delete, Insert, and Finding of Binary Search Tree
The meaning of a binary search tree is that the value of each left child in this binary tree is smaller than its parent node, and the value of each right child is smaller than the parent node An or
[Data Structure] hash table
HashTable-Hash Table/Hash Table is a data structure that directly accesses the memory storage location based on the key.
It uses a key value function to map the required data to the position in t
“Data Structure” Chapter 1: Introduction Thinking
[Data Structure] Heap & Priority Queue
To be honest, when I looked at the data structure before, I didn’t pay more attention to the heap until now… .
Heap data structure is an array phenomenon, which can be regarded as a complet
[Data Structure] Simple traversal and basic operation of binary tree
1, construction
2, copy construction
3, destruction
4. depth
5, Number of leaves
6. Pre-order traversal recursive non-recursive
7, Middle-order traversal recursi