New answers tagged binary-search-trees
-1
votes
If inorder traversal of a tree is in ascending order will the tree definitely be a BST?
Yes, another way is to think about the In-order Traversal. You go Left-Root-Right. Well a property of BST is the left node is less than Root and right node is greater than Root. By going in the ...
Top 50 recent answers are included