K-Dimensional Tree [Search and Insert]
source link: https://www.geeksforgeeks.org/videos/k-dimensional-tree-search-and-insert/
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
K-Dimensional Tree [Search and Insert]
- 20 Views
- 03/06/2022
A K-D Tree(also called as K-Dimensional Tree) is a binary search tree where data in each node is a K-Dimensional point in space. In short, it is a space partitioning(details below) data structure for organizing points in a K-Dimensional space.
A non-leaf node in K-D tree divides the space into two parts, called as half-spaces.
Points to the left of this space are represented by the left subtree of that node and points to the right of the space are represented by the right subtree. We will soon be explaining the concept on how the space is divided and tree is formed.
K-Dimensional Tree [Search and Insert] : https://www.geeksforgeeks.org/k-dimensional-tree/
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK