PokeTree is a web app for visually demonstrating and animating Binary Search Trees (BSTs), AVL trees, and binary heaps.

First, choose your data structure:

• BST: Vanilla Binary Search Tree, without rebalancing. The height can be linear in the number of nodes. This mode also supports manual rotation and explicit AVL operations.
• AVL: Adelson-Velsky & Landis trees, with automatic rebalancing after each insertion or deletion. The height is guaranteed to be logarithmic in the number of nodes. This mode forbids manual rotation.
• Max Heap: Binary heap via a complete binary tree (of logarithmic height).

Next, enter commands into the text box in the top left. You can enter one of the following commands:

• clear: Reset the tree to be empty.
• b key key .../build key key ...: Build new structure with the given keys. (Clears all existing keys.)
• a key/add key/i key/ins key/insert key: Insert the given key (if it doesn't exist).
• d key/del key/delete key/rem key/remove key: Delete the given key (if it exists).

BST/AVL-only operations:

• f key/find key: Perform binary search to find the given key.

BST-only operations:

• ai key/avlins key/aa key/avladd key: Insert the given key using the AVL algorithm. If you just use AVL operations, the height remains logarithmic. If you use it on a general BST, there are no guarantees.
• ad key/avldel key/avlrem key: Delete the given key using the AVL algorithm. If you just use AVL operations, the height remains logarithmic.
• avl key: Run the AVL restoration algorithm on the path from the specified node to the root. For example, if you do this right after a vanilla BST insert or delete, this is equivalent to doing an AVL insert or delete.
• r key/right key/rotr key/rotright key/rotater key/rotateright key: Rotate-right the node containing the given key and its left child.
• l key/left key/rotl key/rotleft key/rotatel key/rotateleft key: Rotate-left the node containing the given key and its right child.

Heap-only operations:

• dm/dmax/delm/delmax/deletemax/rm/remm/rmax/remmax/removemax: Delete the maximum key (the root).

Each key can be an integer or a Pokémon name (up to Generation VIII).

• If you enter a Pokémon name, it gets converted into the corresponding National Pokédex number. It's OK if you have typos in the name, or only enter a prefix; we match the Pokémon with a name prefix of the smallest possible edit distance.
• If you enter an integer outside the range [1, 905] (including zero or negative integers), the key gets treated as that integer, but drawn as the Pokémon whose National Pokédex number is the same modulo 905.

You can also specify multiple keys for one operation, e.g., i 1 2 3 4 or d 1,2,3,4.

You can use the checkboxes to toggle display of two properties next to each node:

• Heights (magenta, left): The height of a node is the length of the longest downward path from the node. (An important part of the AVL balancing algorithm.)
• Subtree sizes (cyan, right): The number of nodes in the subtree rooted at the node, i.e., number of descendants including the node itself. (Useful for illustrating sequence binary trees, which support accessing the ith node in traversal order.)
• Heap index (yellow, right): The 1-based index of the node in the heap array, when in heap mode (and more generally, the 1-based BFS order of the node).

You can also speed up or slow down the animations by dragging the slider.

Brynmor Chapman wrote the original version of this demo, which used Python, specifically Tkinter's Canvas widget. Erik Demaine added some features and ported the code to the web platform, specifically using Pug, Stylus, and Civet. Both versions were made as teaching aids for the MIT class 6.1210: Introduction to Algorithms.

Thanks to HybridShivam/Pokemon for providing the Pokémon images, based on Bulbapedia.