AVL Tree Polygon Search

[ShatteredPsycho]

Hello everyone,

 

So I have this exercise about avl trees and I am not too sure how to go about it. The point is to feed a number to the function and having it return the name of the type of polygon. For example, if I send 32 then it returns triacontadi polygon.

 

I have 3 AVL trees, each one with a polygon. A polygon has an int and a String, the number of sides and the name you give the amount of sides he has, like so:

 

Now, the first tree has the "ones" meaning, 1 to 9. The second one has the Tens 10 90. And the third one has the hundreds

 

I started out by trying to devide each search by group, meaning if the wanted number was less than 10 then the search would be on the ones tree. If the search was between 10 and 99 then it would be on the first and second tree and so on. But my approach isn't making a lot of sense in the 21 to 29 cases. I would like to find a general approach to this but so far haven't managed to do so.

 

[mathijs727]

Do you only need to find values in that table or also any other polygon name that can be build using that table (ie  42)?

[ShatteredPsycho]

10 hours ago, mathijs727 said:

Do you only need to find values in that table or also any other polygon name that can be build using that table (ie  42)?

Other polygon from one, two or the three tables

2 -> first table

34 -> 1st and 2nd

935 -> the 3 tables

[mathijs727]

31 minutes ago, ShatteredPsycho said:

Other polygon from one, two or the three tables

2 -> first table

34 -> 1st and 2nd

935 -> the 3 tables

So build seperate trees for 0-10, 10,20,30...100 and 100,200,300,...,1000.

Split your input query into seperate digits (935 -> 9, 3, 5) and look them up in the trees?

 

And if you need, build an AVL with exceptions.

Look up the query in that tree and if it fails then use the normal naming scheme (described above).

[ShatteredPsycho]

2 hours ago, mathijs727 said:

So build seperate trees for 0-10, 10,20,30...100 and 100,200,300,...,1000.

Split your input query into seperate digits (935 -> 9, 3, 5) and look them up in the trees?

 

And if you need, build an AVL with exceptions.

Look up the query in that tree and if it fails then use the normal naming scheme (described above).

Well ofc, that was my intent but my doubt wasn't there.

But I guess I don't really have to be concerned. I can just take the digit, place a 0 after and look them up on three trees