关于此有声读物
What is Quadtree
A quadtree is a tree data structure in which each internal node has exactly four children. Quadtrees are the two-dimensional analog of octrees and are most often used to partition a two-dimensional space by recursively subdividing it into four quadrants or regions. The data associated with a leaf cell varies by application, but the leaf cell represents a "unit of interesting spatial information".
How you will benefit
(I) Insights, and validations about the following topics:
Chapter 1: Quadtree
Chapter 2: Octree
Chapter 3: R-tree
Chapter 4: Binary tree
Chapter 5: B-tree
Chapter 6: AVL tree
Chapter 7: Red-black tree
Chapter 8: Binary search tree
Chapter 9: Binary heap
Chapter 10: Segment tree
(II) Answering the public top questions about quadtree.
(III) Real world examples for the usage of quadtree in many fields.
Who this book is for
Professionals, undergraduate and graduate students, enthusiasts, hobbyists, and those who want to go beyond basic knowledge or information for any kind of Quadtree.
