Let me write my first thread here about #binaryTrees and how #algorithms can differ from case to case.
So I wrote, in #python, 2 different implementations for an Integer Binary Tree:
- Recursive
- Iterative
You can check here the code: https://gist.github.com/ttiagojm/526b3f3634dbc751f693c81ae1e20996
And as you can see there is no gain, sometimes even recursion is faster than iterative.
Then I was intrigued by this result and I tried to run an identical test on a project.
1/2


