Hello.I'm looking to implement a binary tree (traversal, sorting and the like)... Preferably without the use of recursion, because it's fscking complicated and it never bloody works. One more ...

So when do you use sorted arrays and when do you used binary trees? Do you have any rules of thumb? I guess that for small number of elements. Say 10-20, a sorted array will be all around faster?