❔ guys please help me with AVL Trees
I have a project where I need to create a box object using a data structure that will be most efficent to store boxes insert, delete, search for exact match
and if no exact match search for closest bigger > than searched box I am trying to use a AVLTree, That store another AVL tree in case there is duplicates
and in the duplicated it should be sorted by Y instead of X in the main AVLtree I was wondering if there is a way to see it visualy instead of using debug
very annoying to try and understand how is it sorted Tried to use Graphviz / Plant.net having problems can anyone help me with viewing it
or help me to suggest the mst efficent data structure to use
any help would be much appreciated
and if no exact match search for closest bigger > than searched box I am trying to use a AVLTree, That store another AVL tree in case there is duplicates
and in the duplicated it should be sorted by Y instead of X in the main AVLtree I was wondering if there is a way to see it visualy instead of using debug
very annoying to try and understand how is it sorted Tried to use Graphviz / Plant.net having problems can anyone help me with viewing it
or help me to suggest the mst efficent data structure to use
any help would be much appreciated
