This repository was developed to show examples of visualization of data structures, specifically trees.
Basically, this tree always works with two nodes, left and right. The left node is always smaller than the parent node, but the right node is always bigger than the parent node.
This is a BST that simulates a 2-3 tree, each double node is represented by two simple nodes connected by a red link (always leaning to the left).
This tree is used to implement string symbol tables, each node can have n children, one for each possible character.