Recent questions tagged tree

1 votes
0 answers
91
A 2-3 tree is a tree such that(i) All the internal nodes have either 2 or 3 children(ii) All paths from root to the leaves have the same lengthThe number of internal node...
1 votes
1 answer
92
Q-We are given set of n distinct elements and an unlabled binary tree with n nodes how many ways we can populate the tree with given set so that it becomes binary search...
15 votes
3 answers
94
Consider all possible trees with $n$ nodes. Let $k$ be the number of nodes with degree greater than $1$ in a given tree. What is the maximum possible value of $k$?
3 votes
3 answers
95
What is the difference between height and levels for a tree. What will be the value of height and level for root node and why?
38 votes
7 answers
96
Let $T$ be a tree with $10$ vertices. The sum of the degrees of all the vertices in $T$ is ________
1 votes
2 answers
97
A ternary tree is a tree in which every internal node has exactly three children.The number of leaves in a ternary tree with $’z’$ internal nodes is _______.$2$$\left...
0 votes
3 answers
99
If a node in a BST has two children, then its in-order predecessor hasa) No left childb) No right childc) 2 childrend) no child
2 votes
7 answers
100
Any decision tree that sorts n elements has height ____$\Omega (\lg \: n)$$\Omega (n)$$\Omega (n \: \lg \: n)$$\Omega (n^2)$
0 votes
2 answers
101
A 5-ary tree is a tree in which every internal node has 3 children.The number of leaf nodes in such a tree with 10 internal nodes is______
1 votes
1 answer
103
6 votes
1 answer
108
which formula should we use for calculating LEAF node in B+ tree?I. n*(K+r)+b<=block sizewhere n=no of keysk=key size,r=record pointer,b=block pointerII. (n-1)(K+r)+b<=bl...
4 votes
2 answers
110
18 votes
1 answer
113
Difference between left biasing and right biasing in B+ tree insertion, Rules to be followed for left and right biasing , Kindly explain with an example ?
2 votes
1 answer
115
what are the complexities of different trees like BST,AVL,HEAP,B-tree etc for insertion updation deletion for all 3 cases 1)best 2)avg 3)worst
4 votes
1 answer
116
1 votes
1 answer
117
There are nn-2 labeled trees with n vertices(n>2)Can anyone explain it with complete proof?
2 votes
3 answers
118
Consider a complete graph on 10 vertices. Minimum no. of edge removals required to make a tree out of it will be ____
2 votes
3 answers
119
A $2-3$ tree is a tree such thatall internal nodes have either 2 or 3 childrenall paths from root to the leaves have the same length.The maximum number of nodes of a 2-3 ...
1 votes
2 answers
120