Is it possible to make linear methods for a recursive structure?

Question

go

All the code that I've seen to access the recursive structure was built on recursive functions https://play.golang.org/p/jsKrQ7l3Q9 It is known that Go does not optimize tail-call-recursion. Is it even theoretically possible otherwise? How to write a btree with non-recursive methods in Go (in any procedural language)?

Answer 1

See graph traversal using queue or stack.