Ask Question
17 November, 01:59

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

+2
Answers (1)
  1. 17 November, 03:18
    0
    Answer: The difference between the binary search tree and the binary tree are as follows:-

    Binary search tree is the binary tree that has some specific structure whereas the binary tree is the data structure that has some particular hierarchy design. Nodes of the binary search tree are present in a specific order while the nodes of the binary tree have the one parent node and maximum of two child nodes. Binary search tree has the main activity of searching through keys whereas the binary tree performs several operations like inserting the element, deletion, etc.
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “What is the difference between a binary tree and a binary search tree? ...” in 📘 Computers and Technology if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers