In which transversal technique do I get sorted elements for a binary search tree?
1) Post order traversal
2) In order traversal
3) Pre order traversal
4) None