A segment tree is a binary tree which can solve range update and range RMQ in O(log(n)) time. All the nodes have both left child and right child or nor of them.

To toggle between the RMinQ Tree, RManQ Tree and the RSumQ Tree, select the respective header.

All available operations on the segment Tree will be shown here. Select an action and provide the necessary input, and the action will be animated in the visualisation area.

View the visualisation here!

As the action is being carried out, each step will be described in the status panel.

You can also follow the psuedocode highlights to trace the algorithm.

Control the animation with the player controls! Keyboard shortcuts are:
Left/right arrows: step backward/step forward
-/+: decrease/increase speed

Return to "Exploration Mode" to start exploring!