Timeline for Generic binary search tree in C++
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 4, 2018 at 11:27 | history | edited | Incomputable | CC BY-SA 4.0 |
put missing backtick to fix the formatting
|
| Jun 4, 2018 at 1:33 | comment | added | Cris Luengo | I once wrote a tail-recursive algorithm for binary trees, then rewrote it as an iterative algorithm. The recursive version was faster. Maybe it’s me... :) | |
| Jun 4, 2018 at 0:26 | comment | added | Incomputable | I remember the principle being mentioned by Marshall Clow on one of the CppCon talks. I agree that I could make some functions iterative. I'll add input iterator support, lower_bound and upper_bound and then will post again with the suggestions from this post. | |
| Jun 3, 2018 at 23:12 | history | edited | vnp | CC BY-SA 4.0 |
added 28 characters in body
|
| Jun 3, 2018 at 23:05 | history | answered | vnp | CC BY-SA 4.0 |