One can determine whether a binary tree is a binary search tree by traversing it in
Answers
Answered by
0
Answer:
Yes, you can determine it.
Explanation:
The in-order traversal among all the traversal of a binary search tree given a list of sorted elements. If it doesn't that means the the given tree was not a binary search tree i.e it is just a binary tree.
Answered by
0
One can determine whether a binary tree is a binary search tree by traversing it in
Explanation:
- In the case of binary search trees (BST), Inorder traversal gives nodes in non-decreasing order.
- To get nodes of BST in non-increasing order, a variation of Inorder traversal where Inorder traversal s reversed can be used.
- Inorder is the correct answer.
Similar questions