https://github.com/addytrunks/data_strucuture_cia2
Implementation of KD Tree and B-Tree
https://github.com/addytrunks/data_strucuture_cia2
Last synced: 12 months ago
JSON representation
Implementation of KD Tree and B-Tree
- Host: GitHub
- URL: https://github.com/addytrunks/data_strucuture_cia2
- Owner: addytrunks
- Created: 2024-04-21T03:33:22.000Z (about 2 years ago)
- Default Branch: main
- Last Pushed: 2024-05-10T03:06:39.000Z (about 2 years ago)
- Last Synced: 2024-05-10T04:39:30.038Z (about 2 years ago)
- Language: C++
- Size: 38.1 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Data Structures
## Overview
Welcome to the Data Structures repository! This repository contains implementations of B Tree and KD Tree data structures in C++.
## Table of Contents
1. [KD Tree](./KD-TREE/README.md)
2. [B Tree](./B-TREE/README.md)
## KD Tree
A KD Tree, short for K-Dimensional Tree, is a data structure used for organizing points in a k-dimensional space. It is a binary tree structure where each node represents a k-dimensional point. KD Trees are particularly useful for efficient nearest neighbor search and range search operations in multi-dimensional spaces.
For more information and detailed usage of the KD Tree implementation in this repository, navigate to the [KD Tree folder](./KD-TREE/README.md).
## B Tree
A B Tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time. B Trees are commonly used in database systems and file systems.
For more information and detailed usage of the B Tree implementation in this repository, navigate to the [B Tree folder](./B-TREE/README.md).
## College Project
This project is part of my college coursework in artificial intelligence and data science at SNU Chennai.