0
What is the different between a binary search tree and a binary tree?
Wiki User
∙ 11y ago
self depend friend"s............
Wiki User
∙ 11y ago
Add your answer:
Earn +20 pts
Does binary tree and binary search tree same?
no they are not same
What is complexity of binary search tree?
The complexity of binary search tree : Search , Insertion and Deletion is O(h) . and the Height can be of O(n) ( if the tree is a skew tree). For Balanced Binary Trees , the Order is O(log n).
How do you print all data in a Binary Search Tree?
By using Depth First Search or Breadth First search Tree traversal algorithm we can print data in Binary search tree.
What is a difference between binary tree and binary?
I think a binary tree is a thing to help you search whereas binary is 100100101010, that thing that computers use...I think the difference is that a binary tree helps you search but binary is the thing that computers use:10010101001010 The term binary refers to the idea that there are "2" options. In terms of computers at a low level, this refers to 1's and 0's (high voltage and low voltage). A binary tree is a completely different concept. It is a type of data structure with a parent node that branches down into 2 child nodes at each level. If implemented as a binary *search* tree it is pretty efficient at searching data sets that are ordered (O(log n))
Difference between B-tree and Binomial search tree?
A B-tree is a kind of tree data structure which is a generalization of a binary search tree where each node can have more than two children and contain more than 1 value. A Binominal search tree I am not sure of. If you mean Binary search tree, then it is an abstract data structure. Binominal is a term usually used with distributions while Binary is usually used with data. Hope this helps.
Is sorting a binary search tree simple?
A binary search tree is already ordered. An in order traversal will give you a sorted list of nodes.
What is the use of binary?
Binary trees are commonly used to implement binary search tree and binary heaps.
What is binary search in data structure using c?
a tree which has atmost two nodes is called binary tree binary search tree is a binary tree which satisfies the following 1.every node in tree must be distinct 2.values in right subtree > value at root 3.values in left subtree < value at root 4.left,right subtrees must be binary search trees
Where might one find information about a binary search tree?
One can find information about a binary search tree from a few different places. One can find information at sites such as Wikipedia and You Tube or from taking computer classes that teach about data structures.
What is the difference between extended binary tree and a binary search tree?
A strictly binary tree is one where every node other than the leaves has exactly 2 child nodes. Such trees are also known as 2-trees or full binary trees. An extended binary tree is a tree that has been transformed into a full binary tree. This transformation is achieved by inserting special "external" nodes such that every "internal" node has exactly two children.
Why we don't use m way search tree instead of binary search tree?
Well, you might if you want to.
What is the height of binary search tree in worst case?
In the worst case a binary search tree is linear and has a height equal to the number of nodes. so h=O(h).
