Part 6Data Structure
Part 6 Data Structure — learning path connecting EDA fundamentals to open practice.
In this section
vector
Vector: A quantity that has both magnitude and direction is called a vector. The vector s…
02matrix
This article introduces a very important content in linear algebra - matrix (Matrix). It …
036.3 Heap
The heap is a binary tree implemented with an array, so it does not use parent or child p…
04AVL tree
AVL tree: It is the earliest self-balancing binary search tree invented. In an AVL tree, …
056.5 Binary search tree
**1. Definition: **Binary search tree, also called binary search tree, or binary sorting …
066.6 KD tree
If you continue to use the balanced binary tree method, you need to first obtain the sets…
07Partition tree
The partition tree is a data structure based on the line segment tree. It also uses the i…
08Basic concepts
The segment tree is also a binary search tree. Each node of the segment tree is an interv…
09Data Structure Test
Data Structure Test is part of the open iEDA documentation set. This page summarizes the …