Question

One can determine whether a binary tree is a binary search tree by traversing it in.

Answer 1

One can determine whether a binary tree is a binary search tree by traversing it in is In-order Traversal.

How do you traverse a binary search tree?

In-order Traversal

In this traversal method, the left subtree is visited first, then the root and later the right sub-tree. We should always remember that every node may represent a subtree itself. If a binary tree is traversed in-order, the output will produce sorted key values in an ascending order.

As,

In the case of binary search trees (BST), In-order traversal gives nodes in non-decreasing order.

For Inorder, you traverse from the left subtree to the root then to the right subtree.

To get nodes in non-increasing order,  Inorder traversal s reversed can be used.

Hence, traversing is  Inorder

Learn more about Binary search tree here:

brainly.com/question/12946457

#SPJ4