C++ implementation of a data structure for computing next-node-on-path queries between two nodes in an n-ary tree.
The queries run in O(1) time, after O(n) time and space preprocessing of the tree.
-
Notifications
You must be signed in to change notification settings - Fork 0
rein5/next-node-on-path
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
C++ implementation of a data structure for computing O(1)-time next-node-on-path queries between two nodes in an n-ary tree (after O(n) time and space preprocessing of the tree.)
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published