Link/ cut tree - Data Structures

A link/cut tree is a type of data structure capable of merging (link operation) and splitting (cut operation) data sets in O(log(n)) amortized time, as well as finding which tree an element belongs to in O(log(n)) amortized time. In the original publication, Sleator and Tarjan referred to link/cut trees as "dynamic trees."


All rights reserved © 2018 Wisdom IT Services India Pvt. Ltd DMCA.com Protection Status

Data Structures Topics