Scribd Logo
Upload

Welcome to Scribd!

  • 24vsrb Note

    Uploaded by

    Aryan Adlakha
    9 views1 page
    A red-black tree is a binary representation of a 2-4 tree that is more efficient in space utilization. A 2-4 tree stores data in nodes with 2, 3, or 4 children, while a red-black tree represents this through coloring nodes red or black to simulate the structure of a 2-4 tree using only binary nodes. Dashed lines in the red-black tree representation indicate links not present in the corresponding 2-4 tree, and a child connected by a dashed link is colored red.

    Original Description:

    Original Title

    24vsrb-note

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    A red-black tree is a binary representation of a 2-4 tree that is more efficient in space utilization. A 2-4 tree stores data in nodes with 2, 3, or 4 children, while a red-black tree represents this through coloring nodes red or black to simulate the structure of a 2-4 tree using only binary nodes. Dashed lines in the red-black tree representation indicate links not present in the corresponding 2-4 tree, and a child connected by a dashed link is colored red.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    9 views1 page

    24vsrb Note

    Uploaded by

    Aryan Adlakha
    A red-black tree is a binary representation of a 2-4 tree that is more efficient in space utilization. A 2-4 tree stores data in nodes with 2, 3, or 4 children, while a red-black tree represents this through coloring nodes red or black to simulate the structure of a 2-4 tree using only binary nodes. Dashed lines in the red-black tree representation indicate links not present in the corresponding 2-4 tree, and a child connected by a dashed link is colored red.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    2-4 tree vs red-black tree R.

    Inkulu

    • A red-black tree is a binary representation of a 2-4 tree.

    In the above figure, a dashed (resp. non-dashed) link in red-black tree denotes that that link is not present
    (resp. present) in the 2-4 tree.

    And, a child node v is connected to its parent with a dashed (resp. non-dashed) link, then v is colored red
    (resp. black) in the reb-black tree.

    • As compared to 2-4 trees, red-black representation is efficient with respect to the utilization of space. This
    is immediate from the below example.

    - [Courtesy: Above figures are from ’Fundamentals of Data Structures by E. Horowitz, S. Sahni, and S. A.-Freed’.]

    You might also like