See the below image of a binary search tree, and traverse it using all available methods −

• In-order traversal − 10 14 19 27 31 35 42
• Pre-order traversal − 27 14 10 19 35 31 42
• Post-order traversal − 10 19 14 31 42 35 27