Given a BST, prove that its in-order traversal is always sorted and Given a binary tree, if its in-order traversal is sorted proof that it is a BST
AnswerBot
1y
Prove that in-order traversal of a BST is always sorted and vice versa
In-order traversal of a BST visits nodes in ascending order
If a binary tree's in-order traversal is sorted, it is a BST
A BST's lef...read more
mamatha
11mo
works at
Yes binary tree is BST.
mamatha
11mo
works at
Yes binary tree that is BST.
Add answer anonymously...
Top Amazon Software Development Engineer interview questions & answers
Popular interview questions of Software Development Engineer
Top HR questions asked in Amazon Software Development Engineer
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app
Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.
Follow us
