The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we help you to solve your academic and programming questions fast.
In eduladder you can Ask,Answer,Listen,Earn and Download Questions and Question papers.
Watch related videos of your favorite subject.
Connect with students from different parts of the world.
Apply or Post Jobs, Courses ,Internships and Volunteering opportunity. For FREE
See Our team
Wondering how we keep quality?
Got unsolved questions? Ask Questions

Questions-on-c-->View question

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

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

Asked On2019-09-04 14:17:27 by:bigboxer850

Taged users:

Be first to like this question

Be first to dislike this question
Talk about this  Like  Dislike
View all qusetions

Difference Between Binary Tree and Binary Search Tree

1.       Definition of Binary Tree and Binary Search Tree – Binary Tree is a hierarchical data structure in which a child can have zero, one, or maximum two child nodes; each node contains a left pointer, a right pointer and a data element. There’s no particular order to how the nodes should be organized in the tree. Binary Search Tree, on the other hand, is an ordered binary tree in which there is a relative order to how the nodes should be organized.

2.       Structure  of Binary Tree and Binary Search Tree– The topmost node in the tree represents the root pointer in a binary tree, and the left and the right pointers represent the smaller trees on either side. It’s a specialized form of tree which represents data in a tree structure. Binary search tree, on the other hand, is a type of binary tree in which all the nodes in the left subtree are less than or equal to the value of the root node and that of the right subtree are greater than or equal to the value of the root node.

3.       Operation of Binary Tree and Binary Search Tree– Binary tree can be anything that has two children and one parent. Common operations that can be performed on a binary tree are insertion, deletion, and traversal. Binary search trees are more of sorted binary trees that allows for fast and efficient lookup, insertion, and deletion of items. Unlike binary trees, binary search trees keep their keys sorted, so lookup usually implements binary search for operations.

4.       Types of Binary Tree and Binary Search Tree– There are different types of binary trees, the common being the “Full Binary Tree”, “Complete Binary Tree”, “Perfect Binary Tree”, and “Extended Binary Tree”. Some common types of binary search trees include T-trees, AVL trees, Splay trees, Tango trees, Red-Black trees etc.

Answerd on:2019-09-09 Answerd By:Tanisha-Garg

Be first to like this answer

Be first to dislike this answer
Talk about this  Like  Dislike

You might like this video:Watch more here

Watch more videos from this user Here

Learn how to upload a video and start earning here

Lets together make the web is a better place

We made eduladder by keeping the ideology of building a supermarket of all the educational material available under one roof. We are doing it with the help of individual contributors like you, interns and employees. So the resources you are looking for can be easily available and accessible also with the freedom of remix reuse and reshare our content under the terms of creative commons license with attribution required close.

You can also contribute to our vision of "Helping student to pass any exams" with these.
Answer a question: You can answer the questions not yet answered in eduladder.How to answer a question
Career: Work or do your internship with us.Work with us
Create a video: You can teach anything and everything each video should be less than five minutes should cover the idea less than five min.How to upload a video on eduladder