In a binary search tree, which of the following traversals would print the numbers in the ascending order? Q & A › Category: Data Structure › In a binary search tree, which of the following traversals would print the numbers in the ascending order? -1 Vote Up Vote Down Admin Staff asked 4 years ago In a binary search tree, which of the following traversals would print the numbers in the ascending order? a) Level-order traversal b) Pre-order traversal c) Post-order traversal d) In-order traversal Share this:TwitterFacebookWhatsAppPinterestLike this:Like Loading... 1 Answers 1 Vote Up Vote Down Admin Staff answered 4 years ago d) In-order traversal Share this:TwitterFacebookWhatsAppPinterestLike this:Like Loading...