11 docs tagged with "visualization"

Binary search algorithm visualization.

Interactive visualization binary search tree.

Find k largest element using quickselect algorithm (extension of Quicksort).

Mergesort step-by-step interactive visualization.

Quicksort step-by-step interactive visualization.

A red-black tree is a self-balancing binary search tree that uses color-coded nodes to maintain balance and ensure efficient search, insertion, and deletion operations.

A segment tree is a binary tree data structure that allows answering range queries and updating values in an array in logarithmic time.