Build, range-query, and update animated on a real tree — ranges tile into O(log n) blocks and updates touch only the root path.
Tip: use samples, upload, copy, download, and send-to actions inside the workspace where available.
Segment Tree Visualizer is a free, browser-based tool that helps you turn raw numbers into clear charts. Build, range-query, and update animated on a real tree — ranges tile into O(log n) blocks and updates touch only the root path. It's built for speed and privacy: Everything runs locally in your browser — your data is never uploaded to a server. No sign-up, no installs, and no daily limits.
Visualize the dataset after it has been cleaned enough for reliable labels and numeric values.
Review the preview, copy or download the result, and keep everything local in your browser.
Fenwick Tree (BIT) Visualizer: The trailing-bit trick animated: i & −i jumps for updates and prefix sums, each covering a doubling block — ten lines of code, O(log n) everything.
Open toolBinary Search Tree Visualizer: Insert, delete, search, and traverse a BST, AVL tree (animated rotations with balance factors), or min-heap — every comparison narrated, every pointer move animated.
Open toolTrie Visualizer: A prefix tree growing word by word — shared prefixes stored once, word-ends marked, and every insert costing only the word's length.
Open toolleaves = array [23, 4, 41, 17, 8, 46, 12, 5]
1Segment tree over [23, 4, 41, 17, 8, 46, 12, 5]: leaves are the array, every parent stores the SUM of its children. Build O(n); range queries and point updates O(log n).
leaves = array; parent = sum(children)query(l, r):take maximal blocks on both edgesO(log n) blocks tile the rangeupdate(i): fix the leaf → root path
Leaves are the array; parents hold sums. Any range decomposes into O(log n) maximal blocks, and updates touch only a root path.
