Algorithms and Data Structures 1

          • Assignment 2
          • Assignment 3
            • Connected
            • Find
            • Union
            • Quick Find
            • Path Compression
            • Quick Union
            • Weighted Quick Union
          • Dynamic Connectivity
          • Graph
            • Double Hashing
            • Hash Table Probing
            • Linear Probing
            • Open Addressing
            • Quadratic Probing
          • Hash Function
          • Hash Table
          • Hash Value
          • Keyspace
          • Parity Preserving Operator
          • Separate Chaining
          • Linked List
          • List
          • Midterm Answer Structure
          • Amortised Analysis
          • Asymptotic
          • Notations
          • Order of growth
          • Binary Heap
          • Priority Queue
          • Queue
          • Brute Force Running Time
          • Decision Problem
          • NP
          • NP Complete
          • P
          • Polynomial Running Time
          • Running Time
          • Solving
          • Verification
            • Left Leaning Red Black Tree Question
            • Left Leaning Red-Black Tree
            • Red Black Tree
            • Inorder Traversal
            • Postorder Traversal
            • Preorder Traversal
          • Balanced Binary Search Tree
          • Binary Search Tree
          • Predecessor Node
          • Successor Node
        • Algorithm
        • Data structures
        • General computation problem
    Home

    ❯

    Notes

    ❯

    Dynamic Connectivity

    ❯

    Quick Union

    ❯

    Weighted Quick Union

    Weighted Quick Union

    Dec 10, 20241 min read

    Weighted Quick Union is a data structure implementing Dynamic Connectivity, and a variant of Quick Union.

    It improves the base structure by keeping track of the size of each tree to help avoid creating tall trees by balancing them more effectively.


    Graph View

    Backlinks

    • Quick Union

    Created with Quartz v4.4.0 © 2024

    • GitHub
    • Discord Community