← all demos
Computer & Data Science

Binary Search Tree

left < node < right
Binary Search Tree

Every node's left subtree holds smaller keys and its right subtree larger ones, so a search walks one root-to-leaf path in O(log n).

Computed & rendered in pure C# on the frozen OnlyCSharp 1.8 library — animation baked to GIF with the library's own Gif encoder (no GPU, no ffmpeg, no external packages).