This new application on binary trees, allows you to enter one to one keys in the structure and draw the tree to study how is modified. AVL trees, red-black trees and binary trees are included.
For version 4.0, an option that allows rebuilding was added a
binary tree from their paths and inorder Preorder
or inorder and Posorden.
For version 7, the module is added to insert and remove a B-tree keys of order 1 (tree 2-3). The user can draw the tree when required and thus visualize the dynamics of the structure.
Issues of data structures should investigate the previously (in class time or the Internet, or a particular course) to understand how each tree in this program.
For version 4.0, an option that allows rebuilding was added a
binary tree from their paths and inorder Preorder
or inorder and Posorden.
For version 7, the module is added to insert and remove a B-tree keys of order 1 (tree 2-3). The user can draw the tree when required and thus visualize the dynamics of the structure.
Issues of data structures should investigate the previously (in class time or the Internet, or a particular course) to understand how each tree in this program.
Show More
