Bifalgorithm post

Keep data sorted as a tree and you can find anything in login steps. Every node has up to two children. The one rule. Smaller values go left, larger values go right at every single node. So to find 14, you halve the tree each step. Bigger than 8, go right. Bigger than 12, go right again. Found. That's a binary search tree. Login search, insert and delete. Until it grows lopsided, which is why balanced trees like red-black exist, sorted and halved each step. Follow for more such videos.

Keep data sorted as a tree and you can find anything in login steps. Every node has up to two children. The one rule. Smaller values go left, larger values go…

Ideas in this flowchart

Binary Search Tree
Tree Structure
Node Children
Value Placement Rule
Binary Search Process
Halve Tree Each Step
Example: Find 14
Go Right if Bigger
Login Operations
Search, Insert, Delete
Balanced Trees
Red-Black Trees

Bifalgorithm

Feed/

Keep data sorted as a tree and you can find anything in login steps. Every node has up to two children. The one rule. Smaller values go left, larger values go right at every single node. So to find 14, you halve the tree each step. Bigger than 8, go right. Bigger than 12, go right again. Found. That's a binary search tree. Login search, insert and delete. Until it grows lopsided, which is why balanced trees like red-black exist, sorted and halved each step. Follow for more such videos.

Noah Thompson

"Keep data sorted as a tree and you can find anything in login steps."

👍

0 comments0 shares