RediOne1/Tree-Data-Structure
1
0
Fork 0
mirror of https://github.com/AdrianKuta/Tree-Data-Structure.git synced 2026-06-19 19:00:14 +02:00
Code Issues Actions Packages Projects Releases Wiki Activity

feat: add tree query algorithms (lowestCommonAncestor/distance/pathBetween/contains) (#35) (#42)

Browse Source
This commit is contained in:
Adrian Kuta
2026-06-07 22:36:48 +02:00
committed by GitHub
parent 06eae4841e
commit 30b2709803
4 changed files with 220 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
CHANGELOG.md
View File

@@ -9,6 +9,8 @@ All notable changes to this project are documented here. The format is based on
### Added
- Structural mutation helpers on `TreeNode`: `insertChild`, `removeChildAt`, `replaceChild`,
`moveChild`, `addChildren`, and `sortChildren`.
- Tree query extensions: `lowestCommonAncestor`, `distance`, `pathBetween`, and `contains` for
finding common ancestors, edge distances, the path between two nodes, and value membership.
### Changed
- Rewrote the README for clarity: one consistent example tree, task-oriented sections