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
Related Tags
binary-search-trees × 147data-structures × 51
binary-trees × 48
algorithms × 27
balanced-search-trees × 18
trees × 17
time-complexity × 11
red-black-trees × 11
avl-trees × 9
search-trees × 8
algorithm-analysis × 5
search-algorithms × 5
splay-trees × 5
heaps × 4
graphs × 3
dynamic-programming × 3
probability-theory × 3
hash-tables × 3
big-o-notation × 3
binary-search × 3
asymptotics × 2
sorting × 2
computational-geometry × 2
proof-techniques × 2
discrete-mathematics × 2