Small questions on data structure
        Posted  
        
            by John Graveston
        on Stack Overflow
        
        See other posts from Stack Overflow
        
            or by John Graveston
        
        
        
        Published on 2010-06-15T16:40:42Z
        Indexed on 
            2010/06/15
            16:52 UTC
        
        
        Read the original article
        Hit count: 204
        
algorithm
|data-structures
Hi, I'm trying to search the parent of a node with Kruskal's algorithm. My program works just fine, but I think I have heard of a method to improve the speed of the algorithm by reconstructing the tree while searching for the parent node and connecting it to the parent node. I'm pretty sure that I've heard of this somewhere, maybe in a lecture. Can anyone refresh my memory?
And also, given a number of arrays, when searching for the minimum and the maximum value from a certain section of an array, what is the name of the tree that can calculate the minimum/maximum value from the array by making a binary tree that has the minimum/maximum value of each array in O(log N)?
© Stack Overflow or respective owner