# Inorder tree tranversal on binary search tree doesn't give the elements in order?

I have been told that inorder tree tranversal of binary search trees returns the tree elements in order. I came up with this binary search tree:

      20
/
10
\
26


However the inorder tree tranversal of this seems to be 10, 26, 20?! What is wrong here?

• "I have been told that inorder tree tranversal", it should have been binary search tree. – Turing101 Dec 17 '19 at 13:46
• @HIRAKMONDAL yes I meant to say that – RUBEN GONÇALO MOROUÇO Dec 17 '19 at 15:48
• In your "ASCII-art", is the root at the left or at the top? – greybeard Dec 17 '19 at 17:07
• (Could you decide on traversal rather than transversal?) – greybeard Dec 17 '19 at 17:10

 20