Hello.
I want to write a function to print all the elment in a binomial tree level by level, that means, first print the element in depth 0 and then depth 1, and so on..
but I had a problem that there may be no relationship between the nodes which are at the same depth (e.g. the red circle in the picture). So, how could I print them? Plz give me a method, thx a lot!
Brute force algorithm: In a loop, traverse the entire tree while maintaining your current depth. If you are currently at the "print depth level", print the current node. Once you've traversed the entire tree, increment "print depth level" and do it again. Stop if you traverse the tree without printing anything.
This can be easily optimized in many different ways. Now do your homework!
gg
thx, but I think I do not fully understand your words, could you give me an explanation of that algorithm?
