❔ 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
5 Replies
well... we can tell you need help with AVL trees, but not much other than that. is this a school assignment? Do you have a working AVL tree data structure yet? Are you willing to share your code?
also if you need to sort data along multiple dimensions, an AVL tree probably isnt the best option. AVL (and any binary tree) can only sort data along one dimension, hence your comments about needing multiple trees
hello yes is it a school project I got ill send the code I have so far here?
or maybe I can dm u?
GitHub
GitHub - Itamarcohe/BoxesProject
Contribute to Itamarcohe/BoxesProject development by creating an account on GitHub.
we still need a lot more info to help. yes you shared your code, but we can't run that code how you currently coded it.
what specifically are you currently stuck on?
Was this issue resolved? If so, run
/close - otherwise I will mark this as stale and this post will be archived until there is new activity.