What is the difference between a binary tree and a binary search tree?

A Binary Tree follows one simple rule that each parent node has no more than two child nodes, whereas a Binary Search Tree is just a variant of the binary tree which follows a relative order to how the nodes should be organized in a tree.

the correct answer is: a.)it is never appropriate to use acronyms and emoticons in business communication.