Abstract
Any instance of the disjoint set union problem of size n, using any union strategy, that does one find per node in postorder has total cost $O(n)$. This special case, when the finds are restricted to occur in postorder, is related to the behavior of such self-adjusting data structures as the splay tree and the pairing heap.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
