Dynamic Tree Data Structures

Java swing desktop application. The objective is implement all tree data structures with dynamic operations. This means that create the tree and every operation goes to the tree created. Then studied they times and costs. All data structures is on Structure

AVL Tree

In process AVL Tree Node

Rooted Binary tree

In process Rooted Binary Tree Node

Red Black Tree

In process Red Black Tree Node

Print method