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."
Data Structures Related Interview Questions
|RDBMS Interview Questions||DBMS Interview Questions|
|Adv Java Interview Questions||Core Java Interview Questions|
|C Interview Questions||Database Administration Interview Questions|
|CSS Advanced Interview Questions||Maven Interview Questions|
|Computer architecture Interview Questions||Object Oriented Analysis and Design Interview Questions|
|Standard Template Library (STL) Interview Questions||Xml Publisher Interview Questions|
Data Structures Tutorial
Abstract Data Types
All rights reserved © 2018 Wisdom IT Services India Pvt. Ltd
Wisdomjobs.com is one of the best job search sites in India.