How can we test whether a binary tree is a binary searchtree?

niversity of wS ata Structures 303 Final Exann 6HOW can we test whether a binary tree is a binary search tree? a. For each node, if the left child has a key that is less than the node’s key, and the right child has a key is greater than the node’s key. b. Preorder traversal should return a list ordered in ascending order. c. Inorder traversal should return a list ordered in descending order. d. None of the above. is true about min heaps? Show transcribed image text niversity of wS ata Structures 303 Final Exann 6HOW can we test whether a binary tree is a binary search tree? a. For each node, if the left child has a key that is less than the node’s key, and the right child has a key is greater than the node’s key. b. Preorder traversal should return a list ordered in ascending order. c. Inorder traversal should return a list ordered in descending order. d. None of the above. is true about min heaps?

## Expert Answer

Answer to How can we test whether a binary tree is a binary search tree?…