hey! thanks for the quick replay! by writing "ordinary binary tree" i meant that i'm talking about the 'standard' binary tree that we all know (which have a root, and each node can have only a right/left node sons/two sons,or without any node sons..) , where in a binary search tree, the value of the left node of the root is smaller than the value of the root itself, and the value of the right node is bigger than the value of the root ...) Richard, i tried to time them, and i got almost the same time, to make my question more clear, i wanted to know if there is a specific (different) algorithm which i can use on the binary search tree, which will give me a better running time than when i run the print algorithm on a 'standard' binary tree... thanks again!

Mehdi, this is my solution as well (where o(n) is my running time, my question is : "if i was using a binary search tree for this purpose,can i write a different algorithm which could improve my running time? thanks!

thanks for the quick replay!

by writing "ordinary binary tree" i meant that i'm talking about the 'standard' binary tree that we all know (which have a root, and each node can have only a right/left node sons/two sons,or without any node sons..) , where in a binary search tree, the value of the left node of the root is smaller than the value of the root itself, and the value of the right node is bigger than the value of the root ...)

Richard, i tried to time them, and i got almost the same time, to make my question more clear, i wanted to know if there is a specific (different) algorithm which i can use on the binary search tree, which will give me a better running time than when i run the print algorithm on a 'standard' binary tree...

thanks again!