The Quadtree Data Structure Is A Special Type Of Tree Where The Inner Nodes Have Exactly Four Children

The QuadTree data structure is a special type of tree where the inner nodes have exactly fourchildren. The goal of this tree is to divide a 2D space into four quadrants and have each childrepresent one of them. Each quadrant can further divide into four smaller quadrants and so forthaccording to the level of detail we want to achieve. But not all the partitions need to have the samelevel of detail, i.e. some leafs can be deeper than others. So, in practice, the quadtree is usually not aperfect tree.