/
ssmih
/
Python
Обзор
Документация
Войти
/
ssmih
/
Python
Код
Запросы
0
Задачи
Вики
Пакеты
0
Релизы
0
Аналитика
Безопасность
master
data_structures/kd_tree/kd_node.py
38 строк
1 KB
Ramy
Implemented Suffix Tree Data Structure (#11554)
28 сен 2024, 16:37
Не верифицирован
28 сен 2024, 16:37
976e385
Код
Авторство
О чём код?
# Created by: Ramy-Badr-Ahmed (https://github.com/Ramy-Badr-Ahmed) # in Pull Request: #11532 # https://github.com/TheAlgorithms/Python/pull/11532 # # Please mention me (@Ramy-Badr-Ahmed) in any issue or pull request # addressing bugs/corrections to this file. # Thank you! from __future__ import annotations class KDNode: """ Represents a node in a KD-Tree. Attributes: point: The point stored in this node. left: The left child node. right: The right child node. """ def __init__( self, point: list[float], left: KDNode | None = None, right: KDNode | None = None, ) -> None: """ Initializes a KDNode with the given point and child nodes. Args: point (list[float]): The point stored in this node. left (Optional[KDNode]): The left child node. right (Optional[KDNode]): The right child node. """ self.point = point self.left = left self.right = right