I know there is an algorithm called Breadth-first traversal but I think it's a bit complicated and I didn't want to mix it with queues.
I basically want to print the numbers in a binary tree level by level and I don't want to use a queue to store the values, just print them.
This is a problem that will be (for sure) on my girlfriend's exam but she doesn't understand much of programming in general and I'm trying to help her doing it, though I'm having difficulties making this work because it's been a while since I coded in C and I always had problems regarding pointers.
Could anyone help me with the code to the a function that lists the binary tree values level by level, without queues, just print them directly to the screen in the most easy way to understand?
I would really appreciate it...