On Sat, Jun 8, 2013 at 5:56 PM, Daniel Micay <danielmi...@gmail.com> wrote: > > Efficiency-wise, I don't think it should be a big deal because for up > to 2^32 elements it will only need a stack depth of ~32. It could be > reserving the memory in advance based on the size of the tree. The > recursive version will have stack overflow checks for each level of > recursion so that's not much different than the vector capacity > checks.
(in a self-balancing binary search tree, not an unbalanced one) _______________________________________________ Rust-dev mailing list Rust-dev@mozilla.org https://mail.mozilla.org/listinfo/rust-dev
