troubleshooting Question

Binary Search Trees

Avatar of Vasconcelos
Vasconcelos asked on
Editors IDEsJava
4 Comments1 Solution319 ViewsLast Modified:
For example, imagining that the window was above the dimensions 200x300 (width x height)
and was divided into 6 zones (see A, B, C, D, E and F), And i use the tree to
quickly and efficiently determine if a click in a window would be associated with
any node in the graph. If i click on the 150x150 position (the middle of the zone D). To
the standardization divide all the measurements from the horizontal size ( 'H') or
vertical ( 'V') of the window. Thus, the click would be normalized to the values (x, y) = (150/200,
150/300) = (0.75, 0.50).
I have all the data structures of the trees implemented i only need a head start on this since i dont know what the right way to go on this.

thanks in advange.
BST.png
ASKER CERTIFIED SOLUTION
J K

Our community of experts have been thoroughly vetted for their expertise and industry experience.

Join our community to see this answer!
Unlock 1 Answer and 4 Comments.
Start Free Trial
Learn from the best

Network and collaborate with thousands of CTOs, CISOs, and IT Pros rooting for you and your success.

Andrew Hancock - VMware vExpert
See if this solution works for you by signing up for a 7 day free trial.
Unlock 1 Answer and 4 Comments.
Try for 7 days

”The time we save is the biggest benefit of E-E to our team. What could take multiple guys 2 hours or more each to find is accessed in around 15 minutes on Experts Exchange.

-Mike Kapnisakis, Warner Bros