TREE-DELETE is broken into three cases. Case 1: z has no children. • Delete z by making the parent of z point to NIL, instead of to z. Case 2: z has one child. • Delete z by making the parent of z point to zís child, instead of to z. Case 3: z has two children. • zís successor y has either no children or one child. (y is the minimum nodeówith no left childóin zís right subtree.) • Delete y from the tree (via Case 1 or 2). • Replace zís key and satellite data with yís. ✄ Determine which node y to splice out: either z or zís successor.
TREE-DELETE is broken into three cases. Case 1: z has no children. • Delete z by making the parent of z point to NIL, instead of to z. Case 2: z has one child. • Delete z by making the parent of z point to zís child, instead of to z. Case 3: z has two children. • zís successor y has either no children or one child. (y is the minimum nodeówith no left childóin zís right subtree.) • Delete y from the tree (via Case 1 or 2). • Replace zís key and satellite data with yís. ✄ Determine which node y to splice out: either z or zís successor.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
TREE-DELETE is broken into three cases.
Case 1: z has no children.
• Delete z by making the parent of z point to NIL, instead of to z.
Case 2: z has one child.
• Delete z by making the parent of z point to zís child, instead of to z.
Case 3: z has two children.
• zís successor y has either no children or one child. (y is the minimum
nodeówith no left childóin zís right subtree.)
• Delete y from the tree (via Case 1 or 2).
• Replace zís key and satellite data with yís.
✄ Determine which node y to splice out: either z or zís successor.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education