B-Trees Made Simple | Introduction to B-Trees | B-Tree Operations | Geekific
77.7 هزار بار بازدید -
3 سال پیش
-
Support us on Patreon:
Support us on Patreon: Patreon: Geekific
GitHub Repository: https://github.com/geekific-official/...
Stay updated on our videos by subscribing to the channel and hitting the like button!
Our trees journey began by introducing Binary Search Trees, and couple videos later we tackled self-balancing binary search trees, such as AVL trees and Red-Black trees. However, if we need to store large amounts of data, the self-balancing property will not be enough to prevent the huge increase of the tree height. Therefore, we may find ourselves in need to store more than one key or value in a single node. Or, we may think that having more than two children per node can help us shrink the height of the tree. And that is exactly what B-Trees, the topic of this video, allow us to do.
Timestamps:
00:00 Introduction
00:41 What are B-Trees?
02:22 B-Tree Properties
04:36 Inserting an element in a B-Tree
06:37 Deleting an element from a B-Tree
10:18 Searching for an element inside a B-Tree
11:14 Traversing a B-Tree
12:15 Thanks for Watching!
If you found this video helpful, check other Geekific uploads:
- Generics and Wildcards in Java Made Simple: Generics and Wildcards in Java | Part...
- Project Lombok Annotations Explained: Project Lombok Annotations Explained ...
- Introduction to Trees, Basic Tree Terminology and Different Types of Trees: Introduction to Trees and Basic Tree ...
- Binary Search Trees (BST) Explained and Implemented in Java: Binary Search Trees (BST) Explained a...
- AVL Trees Explained and Implemented in Java: AVL Tree Explained and Implemented in...
- Red-Black Trees Explained and Implemented in Java: Red-Black Trees Explained and Impleme...
#Geekific #DataStructures #BTrees
GitHub Repository: https://github.com/geekific-official/...
Stay updated on our videos by subscribing to the channel and hitting the like button!
Our trees journey began by introducing Binary Search Trees, and couple videos later we tackled self-balancing binary search trees, such as AVL trees and Red-Black trees. However, if we need to store large amounts of data, the self-balancing property will not be enough to prevent the huge increase of the tree height. Therefore, we may find ourselves in need to store more than one key or value in a single node. Or, we may think that having more than two children per node can help us shrink the height of the tree. And that is exactly what B-Trees, the topic of this video, allow us to do.
Timestamps:
00:00 Introduction
00:41 What are B-Trees?
02:22 B-Tree Properties
04:36 Inserting an element in a B-Tree
06:37 Deleting an element from a B-Tree
10:18 Searching for an element inside a B-Tree
11:14 Traversing a B-Tree
12:15 Thanks for Watching!
If you found this video helpful, check other Geekific uploads:
- Generics and Wildcards in Java Made Simple: Generics and Wildcards in Java | Part...
- Project Lombok Annotations Explained: Project Lombok Annotations Explained ...
- Introduction to Trees, Basic Tree Terminology and Different Types of Trees: Introduction to Trees and Basic Tree ...
- Binary Search Trees (BST) Explained and Implemented in Java: Binary Search Trees (BST) Explained a...
- AVL Trees Explained and Implemented in Java: AVL Tree Explained and Implemented in...
- Red-Black Trees Explained and Implemented in Java: Red-Black Trees Explained and Impleme...
#Geekific #DataStructures #BTrees
3 سال پیش
در تاریخ 1400/03/19 منتشر شده
است.
77,710
بـار بازدید شده