BiteSizedChunks.comLearn one small thing at a time.

Course contentsShow

Computer Science

531AVL Tree Definition and Balance Property
532Height-Balance Invariant
533Calculating Balance Factors
534Identifying Imbalance Cases
535Single Right Rotation
536Single Left Rotation
537Left-Right Double Rotation
538Right-Left Double Rotation
539AVL Insertion Algorithm
540Updating Heights After Insertion
541AVL Deletion Overview
542Rebalancing After Deletion
543AVL Tree Height Analysis
544AVL Operation Complexity
545AVL Trees vs Unbalanced BSTs
546Red-Black Tree Properties and Invariants
547Red-Black Tree Height Guarantees
548Red-Black Tree Insertion Overview
549Insertion Case 1: Uncle is Red
550Insertion Case 2: Uncle is Black, Triangle Configuration
551Insertion Case 3: Uncle is Black, Line Configuration
552Red-Black Tree Deletion Overview
553Deletion Cases: Red Sibling
554Deletion Cases: Black Sibling with Red Children
555Red-Black vs AVL Trees: Tradeoffs
556B-Tree Definition and Properties
557B-Tree Node Structure
558B-Tree Invariants
559B-Tree Search Operation
560B-Tree Insertion: Simple Cases
561Node Splitting During Insertion
562Splitting Root Nodes
563B-Tree Deletion: Leaf Node Cases
564B-Tree Deletion: Internal Node Cases
565Borrowing Keys from Siblings
566Merging Nodes in B-Trees
567B-Tree Performance and Applications
568Splay Trees: Self-Adjusting BSTs
569The Splaying Operation
570Zig, Zig-Zig, and Zig-Zag Cases
571Splay Tree Search
572Splay Tree Insertion
573Splay Tree Deletion
574Amortized Analysis of Splay Trees
575Splay Trees vs Other Balanced Trees

Computer Science

531AVL Tree Definition and Balance Property
532Height-Balance Invariant
533Calculating Balance Factors
534Identifying Imbalance Cases
535Single Right Rotation
536Single Left Rotation
537Left-Right Double Rotation
538Right-Left Double Rotation
539AVL Insertion Algorithm
540Updating Heights After Insertion
541AVL Deletion Overview
542Rebalancing After Deletion
543AVL Tree Height Analysis
544AVL Operation Complexity
545AVL Trees vs Unbalanced BSTs
546Red-Black Tree Properties and Invariants
547Red-Black Tree Height Guarantees
548Red-Black Tree Insertion Overview
549Insertion Case 1: Uncle is Red
550Insertion Case 2: Uncle is Black, Triangle Configuration
551Insertion Case 3: Uncle is Black, Line Configuration
552Red-Black Tree Deletion Overview
553Deletion Cases: Red Sibling
554Deletion Cases: Black Sibling with Red Children
555Red-Black vs AVL Trees: Tradeoffs
556B-Tree Definition and Properties
557B-Tree Node Structure
558B-Tree Invariants
559B-Tree Search Operation
560B-Tree Insertion: Simple Cases
561Node Splitting During Insertion
562Splitting Root Nodes
563B-Tree Deletion: Leaf Node Cases
564B-Tree Deletion: Internal Node Cases
565Borrowing Keys from Siblings
566Merging Nodes in B-Trees
567B-Tree Performance and Applications
568Splay Trees: Self-Adjusting BSTs
569The Splaying Operation
570Zig, Zig-Zig, and Zig-Zag Cases
571Splay Tree Search
572Splay Tree Insertion
573Splay Tree Deletion
574Amortized Analysis of Splay Trees
575Splay Trees vs Other Balanced Trees

← Computer Science

Lesson 564 of 2,872·13. Balanced TreesPro lesson

B-Tree Deletion: Internal Node Cases

Delete keys from internal nodes by replacing with predecessor or successor keys from appropriate subtrees.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.

See pricing Back to course