Quote:
|
Originally Posted by Jimbo
Why would you use a binary tree per say, instead of just iterating through the elements and checking them linearly? And even bettery, why not use an optimized library function?
|
binary tree is faster than just going from start to finish(the teacher said that). you can make the bin tree sreach better if you want.
recursion > iteration ?
library function would work. if you want to do it your self then do what i said. thats what first came to mind for doing such a check.