next-node-on-path

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.

Name		Name	Last commit message	Last commit date
Latest commit History 16 Commits
test_results		test_results
.gitignore		.gitignore
LCA.cpp		LCA.cpp
LCA.hpp		LCA.hpp
NextNodeOnPath.cpp		NextNodeOnPath.cpp
NextNodeOnPath.hpp		NextNodeOnPath.hpp
README.md		README.md
RMQ.cpp		RMQ.cpp
RMQ.hpp		RMQ.hpp
TestUtils.cpp		TestUtils.cpp
TestUtils.hpp		TestUtils.hpp
main.cpp		main.cpp
makefile		makefile

Navigation Menu