Upload date
All time
Last hour
Today
This week
This month
This year
Type
All
Video
Channel
Playlist
Movie
Duration
Short (< 4 minutes)
Medium (4-20 minutes)
Long (> 20 minutes)
Sort by
Relevance
Rating
View count
Features
HD
Subtitles/CC
Creative Commons
3D
Live
4K
360°
VR180
HDR
79 results
Why Balanced Trees Matter Balanced trees keep data sorted so you can find, add, or remove items quickly, like a well‑organized ...
0 views
5 days ago
Explains Treap through a small key:priority example: dual BST and min-heap invariants, rotations, deletion, randomized balance, ...
7 views
4 days ago
Speaker : Rajender Tapadia Day24-DAA-Code Explanation for Balanced Binary tree, Symmetric tree Average of each level, Right ...
178 views
3 days ago
B-Trees: Balanced Disk-Based Indexing B‑trees store data in a hierarchy of nodes, each node holding multiple keys and child ...
Welcome to Ram's TechEdify!** In this video, we learn the **Trees concept in Data Structures and Algorithms (DSA)** ...
1 day ago
23 | AVL Tree Rotations | Data Structures** In **AVL Tree Rotations**, you will learn how AVL trees maintain balance after ...
Animates the AVL rule: when a node's subtrees differ in height by two, rotate. Spotting the imbalance with the balance factor, the ...
2 views
6 days ago
Animates the five red-black properties and how recolouring and rotation restore them: recolour under a red uncle, rotate LL, RR, ...
1 view
A "correct" binary search just failed on a million sorted numbers. Here's why — and the one move every search algorithm actually ...
3,969 views
In this video, we study **AVL Trees**, a type of **self-balancing Binary Search Tree (BST)**. The lecture explains how AVL Trees ...
64 views
AVL Trees: Height-Optimized BSTs AVL trees keep binary search trees balanced by ensuring the height difference between left ...
These concepts strengthen your understanding of balanced binary search trees, tree restructuring, height updates, and efficient ...
3 views
... of this height bound, searching for a key takes at most about twice the number of comparisons as a balanced binary search tree.
7 days ago
Problem #270 of the Brute To Best series: Closest Binary Search Tree Value. Given the root of a binary search tree and a target ...
2 days ago
AVL Tree | AVL Numerical | DSA | Semester Exam Preparation Is video me AVL Tree ko simple aur exam-oriented way me explain ...
How does PostGIS efficiently search millions of roads, buildings, lakes, and other geographic objects? The answer involves ...
55 views
... #CodingInterview #Algorithms 00:00 Two decisions behind tree problems 00:22 Tree terminology 00:44 The sample binary tree ...
12 hours ago
Today's problem is “Count Prefix-Balanced Binary Strings” — an Easy level DSA problem with 11K+ accepted submissions and a ...
88 views