red black trees
play

Red-Black Trees Binary Search Trees with O(log n) Worst-Case Time - PowerPoint PPT Presentation

Jan 14, 2023 •32 likes •392 views

Red-Black Trees Binary Search Trees with O(log n) Worst-Case Time per Operation The Red-Black Tree Properties Red-black tree properties Every node has a color, red or black. The root is black. The leaves are black. nil nil nil nil nil

  1. Red-Black Trees Binary Search Trees with O(log n) Worst-Case Time per Operation

  2. The Red-Black Tree Properties Red-black tree properties Every node has a color, red or black. The root is black. The leaves are black. nil nil nil nil nil Both children of a red node are black. nil nil nil nil nil Every root-to-leaf path contains the same nil nil number of black nodes. The black-height of a node x is the number of black nodes on a path from, but not including, x to a leaf. The black-height of T is the black-height of its root.

  3. The Height of a Red-Black Tree with n Nodes Lemma: A red-black tree of black-height h contains at least 2 h – 1 nodes. Lemma: A red-black tree of black-height h has height at most 2 h. nil nil nil nil nil Corollary: A red-black tree with n nodes has height at most 2 log ( n + 1) . nil nil nil nil nil nil nil Corollary: Operations Tree-Minimum, Tree-Maximum, Tree-Predecessor, Tree- Successor, and Find take O( log n) time on a red-black tree of size n.

  4. Rotations—The Key to Height Reduction Right rotation d b b e a d a c c e C A A B B C Left rotation

  5. A Rotation Takes Constant Time Right rotation d b b e a d a c c e C A A B B C d b e a c

  6. A Rotation Takes Constant Time Right rotation d b b e a d a c c e C A A B B C d b e a c

  7. A Rotation Takes Constant Time Right rotation d b b e a d a c c e C A A B B C d b e a c

  8. A Rotation Takes Constant Time Right rotation d b b e a d a c c e C A A B B C d b e a c

  9. A Rotation Takes Constant Time Right rotation d b b e a d a c c e C A A B B C b a d c e

  10. Insertion into a Red-Black Tree 17 19 7 13 18 5 37 nil nil nil nil nil 1 49 25 nil nil nil nil nil 33 nil nil Element to insert: 21

  11. Insertion into a Red-Black Tree Red-black tree properties 4 Every node has a color, red or black. 17 4 The root is black. 19 7 4 13 18 The leaves are black. 5 37 nil nil nil nil nil Both children of a red node are black. 1 49 25 nil nil nil nil Every root-to-leaf path contains the 21 33 same number of black nodes. nil nil nil nil Element to insert: 21

  12. Insertion into a Red-Black Tree Red-black tree properties 4 Every node has a color, red or black. 17 4 The root is black. 19 7 4 13 18 The leaves are black. 5 37 nil nil nil nil nil Both children of a red node are black. 1 49 25 nil nil nil nil nil Every root-to-leaf path contains the 33 same number of black nodes. nil nil Element to insert: 3

  13. Insertion into a Red-Black Tree Red-black tree properties 4 Every node has a color, red or black. 17 4 The root is black. 19 7 4 13 18 The leaves are black. 5 37 No red-red property 8 nil nil nil nil nil Both children of a red node are black. 1 49 25 nil nil nil nil Every root-to-leaf path contains the 4 33 3 same number of black nodes. nil nil nil nil Goal: Restore no-red-red condition while maintaining the other four. Element to insert: 3 Tools: Recoloring of nodes; rotations

  14. Insertion into a Red-Black Tree Red-black tree properties 4 Every node has a color, red or black. 17 4 The root is black. 19 7 4 13 18 The leaves are black. 5 37 No red-red property 8 nil nil nil nil nil Both children of a red node are black. 1 49 25 nil nil nil nil Every root-to-leaf path contains the 4 33 3 same number of black nodes. nil nil nil nil Goal: Restore no-red-red condition while maintaining the other four. Element to insert: 3 Tools: Recoloring of nodes; rotations

  15. Restoring the No-Red-Red Property Invariant: There is exactly one red node x in the tree whose parent may be red. Strategy: ■ Fix the violation of no-red-red property at x ■ This may violate the condition at some ancestor ■ Continue fixing the property at the ancestor (the ancestor becomes x ) Observations: ■ Initially, x has a red parent; hence, x is not the root. ■ If parent[ x ] is red, it is not the root either; parent[parent[ x ]] ? that is, parent[parent[ x ]] exists. ■ If parent[ x ] is black, we are done. parent[ x ] x

  16. Restoring the No-Red-Red Property Invariant: There is exactly one red node x in the tree whose parent may be red. Strategy: ■ Fix the violation of no-red-red property at x ■ This may violate the condition at some ancestor ■ Continue fixing the property at the ancestor (the ancestor becomes x ) Observations: ■ Initially, x has a red parent; hence, x is not the root. ■ If parent[ x ] is red, it is not the root either; parent[parent[ x ]] ? that is, parent[parent[ x ]] exists. ■ If parent[ x ] is black, we are done. parent[ x ] Assumptions: x ■ Neither x nor parent[x] is the root ■ parent[x] is the left child of parent[parent[x]]

  17. Restoring the No-Red-Red Property Invariant: There is exactly one red node x in the tree whose parent may be red. Strategy: ■ Fix the violation of no-red-red property at x ■ This may violate the condition at some ancestor ■ Continue fixing the property at the ancestor (the ancestor becomes x ) Observations: ■ Initially, x has a red parent; hence, x is not the root. ■ If parent[ x ] is red, it is not the root either; parent[parent[ x ]] that is, parent[parent[ x ]] exists. ■ If parent[ x ] is black, we are done. parent[ x ] Assumptions: x ■ Neither x nor parent[x] is the root ■ parent[x] is the left child of parent[parent[x]]

  18. Restoring the No-Red-Red Property Invariant: There is exactly one red node x in the tree whose parent may be red. Strategy: ■ Fix the violation of no-red-red property at x ■ This may violate the condition at some ancestor ■ Continue fixing the property at the ancestor (the ancestor becomes x ) Observations: ■ Initially, x has a red parent; hence, x is not the root. ■ If parent[ x ] is red, it is not the root either; parent[parent[ x ]] that is, parent[parent[ x ]] exists. ■ If parent[ x ] is black, we are done. parent[ x ] Assumptions: x ■ Neither x nor parent[x] is the root ■ parent[x] is the left child of parent[parent[x]]

  19. Restoring the No-Red-Red Property 3 cases: ■ Both parent[ x ] and its parent[parent[ x ]] x sibling are red Recoloring ■ parent[ x ] is red, its sibling parent[ x ] is black, and x is the left child of its parent x ■ As Case 2; but x is the Case 1 right child of its parent

  20. Restoring the No-Red-Red Property 3 cases: ■ Both parent[ x ] and its parent[parent[ x ]] x sibling are red Recoloring ■ parent[ x ] is red, its sibling parent[ x ] is black, and x is the left child of its parent x ■ As Case 2; but x is the Case 1 right child of its parent parent[parent[ x ]] Recoloring Right-rotation parent[ x ] x Case 2

  21. Restoring the No-Red-Red Property 3 cases: ■ Both parent[ x ] and its parent[parent[ x ]] x sibling are red Recoloring ■ parent[ x ] is red, its sibling parent[ x ] is black, and x is the left child of its parent x ■ As Case 2; but x is the Case 1 right child of its parent parent[parent[ x ]] Recoloring + Right-rotation parent[ x ] x Case 2

  22. Restoring the No-Red-Red Property 3 cases: ■ Both parent[ x ] and its parent[parent[ x ]] x sibling are red Recoloring ■ parent[ x ] is red, its sibling parent[ x ] is black, and x is the left child of its parent x ■ As Case 2; but x is the Case 1 right child of its parent parent[parent[ x ]] Recoloring + Left-rotation Right-rotation parent[ x ] x Case 2 Case 3

  23. Insertion into a Red-Black Tree—Summary Observations: ■ Every case takes constant time ■ Case 1 brings x two steps closer to the root and only recolors nodes (no rotations) ■ In Cases 2 and 3, we perform 1 or 2 rotations; then we are done Lemma: An insertion into a red-black tree with n nodes takes O (log n ) time and performs at most two rotations.

  24. Deletion from a Red-Black Tree 17 19 7 13 18 5 37 nil nil nil nil nil 1 49 25 nil nil nil nil nil 33 nil nil Element to delete: 25

  25. Deletion from a Red-Black Tree Red-black tree properties 4 Every node has a color, red or black. 17 4 The root is black. 19 7 4 13 18 The leaves are black. 5 37 4 nil nil nil nil nil Both children of a red node are black. 1 49 33 nil nil nil nil nil nil Every root-to-leaf path contains the same number of black nodes. Element to delete: 25

  26. Deletion from a Red-Black Tree Red-black tree properties 4 Every node has a color, red or black. 17 4 The root is black. 19 7 4 13 18 The leaves are black. 5 37 4 nil nil nil nil nil Both children of a red node are black. 1 49 25 nil nil nil nil nil Every root-to-leaf path contains the 33 same number of black nodes. nil nil Element to delete: 18

  27. Deletion from a Red-Black Tree Red-black tree properties 4 Every node has a color, red or black. 17 4 The root is black. 19 7 4 13 nil The leaves are black. 5 37 4 nil nil nil Both children of a red node are black. 1 49 25 nil nil nil nil nil Every root-to-leaf path contains the 8 33 same number of black nodes. nil nil Element to delete: 18

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Red-Black Trees Outline From (2,4) trees to Red-Black trees Definition and height

Red-Black Trees Outline From (2,4) trees to Red-Black trees Definition and height

Red-Black Trees Outline From (2,4) trees to Red-Black trees Definition and height Search Insertion Restructuring Recoloring Deletion Restructuring Recoloring Adjustment Red-Black Trees 2 (2,4)

735 views • 22 slides
Attendance Question 1 Red Black Trees Red Black Trees 2000 elements are inserted one at a

Attendance Question 1 Red Black Trees Red Black Trees 2000 elements are inserted one at a

Topic 19 Attendance Question 1 Red Black Trees Red Black Trees 2000 elements are inserted one at a time into an initially empty binary search tree "People in every direction p y using the traditional algorithm. What is the No words

674 views • 11 slides
Algorithms and Data Structures Balanced Trees (AVL-Trees, (a,b)-Trees, Red-Black-Trees)

Algorithms and Data Structures Balanced Trees (AVL-Trees, (a,b)-Trees, Red-Black-Trees)

Algorithms and Data Structures Balanced Trees (AVL-Trees, (a,b)-Trees, Red-Black-Trees) Albert-Ludwigs-Universitt Freiburg Prof. Dr. Rolf Backofen Bioinformatics Group / Department of Computer Science Algorithms and Data Structures, January

884 views • 55 slides
2-3-4 Trees and Red- Black Trees 204 erm CS 16: Balanced Trees 2-3-4 Trees Revealed Nodes

2-3-4 Trees and Red- Black Trees 204 erm CS 16: Balanced Trees 2-3-4 Trees Revealed Nodes

CS 16: Balanced Trees 2-3-4 Trees and Red- Black Trees 204 erm CS 16: Balanced Trees 2-3-4 Trees Revealed Nodes store 1, 2, or 3 keys and have 2, 3, or 4 children, respectively All leaves have the same depth k n r b e h n r b e

800 views • 31 slides
Tries and String Matching Where We've Been Fundamental Data Structures Red/black trees,

Tries and String Matching Where We've Been Fundamental Data Structures Red/black trees,

Tries and String Matching Where We've Been Fundamental Data Structures Red/black trees, B-trees, RMQ, etc. Isometries Red/black trees 2-3-4 trees, binomial heaps binary numbers, etc. Amortized Analysis Aggregate,

920 views • 65 slides
Topic 19 Red Black Trees Red Black Trees "People in every direction p y No words

Topic 19 Red Black Trees Red Black Trees "People in every direction p y No words

Topic 19 Red Black Trees Red Black Trees "People in every direction p y No words exchanged No time to exchange And all the little ants are marching g Red and black antennas waving" - Ants Marching, Dave Matthew's Band

657 views • 43 slides
CS 758/858: Algorithms http://www.cs.unh.edu/~ruml/cs758 Red-Black Trees Deletion Fixup 1

CS 758/858: Algorithms http://www.cs.unh.edu/~ruml/cs758 Red-Black Trees Deletion Fixup 1

CS 758/858: Algorithms http://www.cs.unh.edu/~ruml/cs758 Red-Black Trees Deletion Fixup 1 handout: slides Wheeler Ruml (UNH) Class 7, CS 758 1 / 16 Red-Black Trees Red-Black Trees BST Deletion Single Child Immed. Succ.

447 views • 18 slides
, iaie . with - . . EAYI.tw/newArynee.n.ndersoni99s example : / . - tree : Red - Black and

, iaie . with - . . EAYI.tw/newArynee.n.ndersoni99s example : / . - tree : Red - Black and

r - Some history : simpler to code as binary 3- node AA - Trees Encoding : - No null pointers : Bayer 1972 : create tree node 2-3 Trees a ' Black node Sentinel node , nil , and all : Guibasa Red - black Trees - i . Red node 1978 ( a binary

825 views • 3 slides
Red/Black Trees Mark Redekopp David Kempe 2 An example of B-Trees 2-3 TREES 3 Definition

Red/Black Trees Mark Redekopp David Kempe 2 An example of B-Trees 2-3 TREES 3 Definition

1 CSCI 104 B-Trees (2-3, 2-3-4) and Red/Black Trees Mark Redekopp David Kempe 2 An example of B-Trees 2-3 TREES 3 Definition 2-3 Tree is a tree where a 2 Node 4 Non-leaf nodes have 1 value & 2 children or 2 values and 3

998 views • 75 slides
Balanced Search Trees 2-3-4 trees red-black trees References: Algorithms in Java (handout)

Balanced Search Trees 2-3-4 trees red-black trees References: Algorithms in Java (handout)

Balanced Search Trees 2-3-4 trees red-black trees References: Algorithms in Java (handout) Balanced search trees Dynamic sets Search Insert Delete Maximum Minimum Successor(x) (find minimum element x)

1.01k views • 68 slides
Deletion from Red-Black Trees E R R C U D O B S X erm 12.235 CS 21: Red Black Tree

Deletion from Red-Black Trees E R R C U D O B S X erm 12.235 CS 21: Red Black Tree

CS 21: Red Black Tree Deletion February 25, 1998 Deletion from Red-Black Trees E R R C U D O B S X erm 12.235 CS 21: Red Black Tree Deletion February 25, 1998 Setting Up Deletion As with binary search trees, we can always delete

315 views • 20 slides
Relativistic Red-Black Trees Philip Howard 4/28/2010 pwh@cecs.pdx.edu 4/27/2010 1 Red-Black

Relativistic Red-Black Trees Philip Howard 4/28/2010 pwh@cecs.pdx.edu 4/27/2010 1 Red-Black

Relativistic Red-Black Trees Philip Howard 4/28/2010 pwh@cecs.pdx.edu 4/27/2010 1 Red-Black Trees Root Property : The root is black External Property : Every external node is black Internal Property : The children of red nodes

734 views • 38 slides
CS 10: Problem solving via Object Oriented Programming Balance Agenda 1. Balanced Binary Trees

CS 10: Problem solving via Object Oriented Programming Balance Agenda 1. Balanced Binary Trees

CS 10: Problem solving via Object Oriented Programming Balance Agenda 1. Balanced Binary Trees 2. 2-3-4 Trees 3. Red-Black Trees 4. Deletion in 2-3-4 and Red-Black trees 2 Review: Binary Search Trees (BSTS) are an ordered collection of

778 views • 65 slides
Lecture 7 Binary Search Trees and Red-Black Trees Announcements HW 3 released! (Due Friday)

Lecture 7 Binary Search Trees and Red-Black Trees Announcements HW 3 released! (Due Friday)

Lecture 7 Binary Search Trees and Red-Black Trees Announcements HW 3 released! (Due Friday) Today: binary search trees Brief foray into data structures! See CS 166 for more! What are binary search trees? You may remember

974 views • 45 slides
Lecture 6: Binary Search Trees (BST) and Red-Black Trees (RBTs) Instructor: Saravanan

Lecture 6: Binary Search Trees (BST) and Red-Black Trees (RBTs) Instructor: Saravanan

Lecture 6: Binary Search Trees (BST) and Red-Black Trees (RBTs) Instructor: Saravanan Thirumuruganathan CSE 5311 Saravanan Thirumuruganathan Outline 1 Data Structures for representing Dynamic Sets Binary Search Trees (BSTs) Balanced Search

1.14k views • 87 slides
Left-Leaning Red-Black Trees Robert Sedgewick Princeton University Original version: Data

Left-Leaning Red-Black Trees Robert Sedgewick Princeton University Original version: Data

Left-Leaning Red-Black Trees Robert Sedgewick Princeton University Original version: Data structures seminar at Dagstuhl (Feb 2008) red-black trees made simpler (!) full delete() implementation This version: Analysis of Algorithms

1.06k views • 89 slides
CSC 151 Spring 2020 Topic: Trees April 10, 2020 Day 29 Peer Support Opportunities Are there

CSC 151 Spring 2020 Topic: Trees April 10, 2020 Day 29 Peer Support Opportunities Are there

CSC 151 Spring 2020 Topic: Trees April 10, 2020 Day 29 Peer Support Opportunities Are there any online events happening where your classmates could support you? Let me know! Self-Checks Describe the series of steps that bst-find would use in

235 views • 11 slides
Trees Why a tree? Faster than linear data structures More natural fit for some kinds of

Trees Why a tree? Faster than linear data structures More natural fit for some kinds of

Trees Why a tree? Faster than linear data structures More natural fit for some kinds of data Examples? Example Tree root Samis Home Page Teaching Research Activities CS101 CS211 Papers Presentations Terminology

677 views • 24 slides
Trees, Binary Search Trees, Lab 7, Project 2 Bryce Boe

Trees, Binary Search Trees, Lab 7, Project 2 Bryce Boe

Trees, Binary Search Trees, Lab 7, Project 2 Bryce Boe 2013/11/13 CS24, Fall 2013 Outline Stack/Queue Review Trees Binary Search Trees

557 views • 31 slides
Topic 18 Binary Trees "A tree may grow a thousand feet tall, but its leaves will return to

Topic 18 Binary Trees "A tree may grow a thousand feet tall, but its leaves will return to

Topic 18 Binary Trees "A tree may grow a thousand feet tall, but its leaves will return to its roots." -Chinese Proverb Definitions A tree is an abstract data type root node internal one entry point, the root nodes

716 views • 52 slides
Advanced Algorithms COMS31900 Lowest Common Ancestor (with a bit on on Range Minimum Queries)

Advanced Algorithms COMS31900 Lowest Common Ancestor (with a bit on on Range Minimum Queries)

Advanced Algorithms COMS31900 Lowest Common Ancestor (with a bit on on Range Minimum Queries) Rapha el Clifford Slides by Benjamin Sach Advanced Algorithms COMS31900 Lowest Common Ancestor (with a bit on on Range Minimum Queries)

1.9k views • 168 slides
1 You may have noticed that the first section of this week's problem is devoted to defining

1 You may have noticed that the first section of this week's problem is devoted to defining

1 You may have noticed that the first section of this week's problem is devoted to defining exactly what it is we're working with. For what it's worth, it's a lot simpler to explain with a couple pictures. All of those extra words we used to

321 views • 13 slides
Inversions in randomly labelled trees Xing Shi Cai, Cecilia Holmgren, Svante Janson, Tony

Inversions in randomly labelled trees Xing Shi Cai, Cecilia Holmgren, Svante Janson, Tony

Introduction Random Labels Random Trees Key Lemma Inversions in randomly labelled trees Xing Shi Cai, Cecilia Holmgren, Svante Janson, Tony Johansson and Fiona Skerman Introduction Random Labels Random Trees Key Lemma Outline Inversions

432 views • 31 slides
Minimal Spanning Trees Spanning Tree Assume you have an undirected graph G = (V,E)

Minimal Spanning Trees Spanning Tree Assume you have an undirected graph G = (V,E)

Minimal Spanning Trees Spanning Tree Assume you have an undirected graph G = (V,E) Spanning tree of graph G is tree T = (V,E T E, R) Tree has same set of nodes All tree edges are graph edges Root of tree is R

257 views • 25 slides

More recommend