0
Add your answer:
Earn +20 pts
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).
Definition of almost complete binary tree?
A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible.
Can a binary tree be empty?
yes, why not,
What is complexity of insertion in binary search tree?
O(log n)At each step of insertion you are either going to the left child or the right child. In a balanced tree, this will effectively cut the number of possible comparisons in half each time.
What is the number of nodes of degree 2 in binary tree which has n leaf nodes?
Ne=N2+1Here Ne=no. of leaf nodesN2= no. of nodes of degree 2
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 the different between a binary search tree and a binary tree?
self depend friend"s............
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
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).
Is B tree a Binary Search Tree?
Yes because there is no real practical use for a binary tree other than something to teach in computer science classes. A binary tree is not used in the real world, a "B tree" is.
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.
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.
