which tree traversal method is more efficient? recursive or nonrecursive ?

Most of the people says that nonrecursiv is more efficient.

But i have a book of data structure by Langsam, Augenstein and Tenenbaum which says that recursive is more efficient.

So which is more efficient and by how much difference?

Thanks in advance.

binary tree traversal