|
AVL-tree construction
Hi, having some trouble with this, I need to construct an avl tree based off of coordinates - (x,y) which are stored in an array. On odd levels I branch based off of the x value, and on even the y. Problem I'm having is that even though I branch based on alternating precedence, all branches are still subject to previous branches. An immediate thought was to, after selecting my root, create two sub arrays of the values to the left and right and then repeat this routine recursively. This seems way to costly for runtime though - for this project input size won't be large enough to cause problems, but runtime is still important. Any ideas? Not asking anyone to write up code or anything, just for suggestions/thoughts.
|
Linear Mode
