Register

Recent questions tagged tree

1 votes
1 answer
31
Ace BITS&BYTES, #Trees #B-Tree
What is the smallest and largest number of entries for 2_3 BTree (B2_3 Tree) of height 8 (i.e 8 levels) ? 255 & 6560 127 & 2186 6561 & 255 255 & 2186
What is the smallest and largest number of entries for 2_3 BTree (B2_3 Tree) of height 8 (i.e 8 levels) ? 255 & 6560127 & 21866561 & 255255 & 2186
User Avatar
2 votes
0 answers
32
Self Doubt
A tree with n nodes and the property that the heights of the two children of any node differ by at most 2 has O(log n) height. Please explain this statement to be true or false.
A tree with n nodes and the property that the heights of the two children of any node differ by at most 2 has O(log n) height.Please explain this statement to be true or ...
User Avatar
2 votes
1 answer
35
GATE Overflow Test Series | Mock GATE | Test 1 | Question: 18
The preorder traversal sequence of a binary search tree is $26 , 21 , 11 , 6 , 2 , 9 , 13 , 18 , 23 , 38 , 30 , 29 , 42 , 41 , 50 , 43 , 60.$ ... $2 , 9 , 6 , 18 , 13 , 11 , 23 , 21 , 29 , 30 , 41 , 43 , 60 , 50 , 42 , 38 , 26$
The preorder traversal sequence of a binary search tree is $$26 , 21 , 11 , 6 , 2 , 9 , 13 , 18 , 23 , 38 , 30 , 29 , 42 , 41 , 50 , 43 , 60.$$ Which one of the following...
User Avatar
7 votes
1 answer
36
GATE Overflow Test Series | Data Structures | Test 1 | Question: 15
Two balanced binary search trees are given with $m$ and $n$ elements respectively. They can be merged into another balanced binary search tree in $\Theta((m+n)^a {(\log (m+n))}^b)$ time. $2.a + 3b =$ _____
Two balanced binary search trees are given with $m$ and $n$ elements respectively. They can be merged into another balanced binary search tree in $\Theta((m+n)^a {(\log (...
User Avatar
3 votes
1 answer
37
GATE Overflow Test Series | Data Structures | Test 1 | Question: 19
The maximum number of leaf nodes in a tree with degree $5$ and height (starting from $1)\;4$ is __________
The maximum number of leaf nodes in a tree with degree $5$ and height (starting from $1)\;4$ is __________
User Avatar
1 votes
3 answers
39
NIELIT 2016 DEC Scientist B (CS) - Section B: 42
The maximum number of nodes in a binary tree of level $k, k\geq1$ is: $2^k+1$ $2^{k-1}$ $2^k-1$ $2^{k-1}-1$
The maximum number of nodes in a binary tree of level $k, k\geq1$ is:$2^k+1$$2^{k-1}$$2^k-1$$2^{k-1}-1$
User Avatar
2 votes
1 answer
40
NIELIT 2017 July Scientist B (CS) - Section B: 54
In a complete $k$-ary tree, every internal node has exactly $k$ children. The number of leaves in such a tree with $n$ internal nodes is $nk$ $(n-1)k+1$ $n(k-1)+1$ $n(k-1)$
In a complete $k$-ary tree, every internal node has exactly $k$ children. The number of leaves in such a tree with $n$ internal nodes is$nk$$(n-1)k+1$$n(k-1)+1$$n(k-1)$
User Avatar
6 votes
3 answers
41
ISRO2020-71
Of the following, which best approximates the ratio of the number of nonterminal nodes in the total number of nodes in a complete $K$-ary tree of depth $N$ ? $1/N$ $N-1/N$ $1/K$ $K-1/K$
Of the following, which best approximates the ratio of the number of nonterminal nodes in the total number of nodes in a complete $K$-ary tree of depth $N$ ?$1/N$$N-1/N$$...
User Avatar
5 votes
4 answers
43
CMI2019-A-3
Suppose that the figure to the right is a binary search tree. The letters indicate the names of the nodes, not the values that are stored. What is the predecessor node, in terms of value, of the root node $A?$ $D$ $H$ $I$ $M$
Suppose that the figure to the right is a binary search tree. The letters indicate the names of the nodes, not the values that are stored. What is the predecessor node, i...
User Avatar
1 votes
1 answer
44
AVL Tree Balancing
here what to do first as FIZZA and IMRAN both are unbalanced than either to do RR rotation from FIZZA-IMRAN-NAVEEN or RL rotation from IMRAN-NAVEEN-LOVELY
here what to do first as FIZZA and IMRAN both are unbalanced than either to do RR rotation from FIZZA-IMRAN-NAVEEN or RL rotation from IMRAN-NAVEEN-LOVELY
User Avatar
0 votes
1 answer
45
Made Easy:Programming &DS
The number of possible ordered trees with 3 nodes A,B,C is ??
The number of possible ordered trees with 3 nodes A,B,C is ??
User Avatar
1 votes
0 answers
46
self doubt
For range queries every B+ tree index requires less I/O than a full table scan. can anyone explain?
For range queries every B+ tree index requires less I/O than a full table scan.can anyone explain?
User Avatar
0 votes
0 answers
47
Self Doubt
Leaf Nodes =[ Internal nodes with degree 2 ] + 1 It is valid if we consider Tree as undirected graph ? Or is it valid only for Tree when considered as directed graph
Leaf Nodes =[ Internal nodes with degree 2 ] + 1It is valid if we consider Tree as undirected graph ?Or is it valid only for Tree when considered as directed graph
User Avatar
8 votes
2 answers
48
GATE Overflow | Mock GATE | Test 1 | Question: 13
For a given $m$-ary tree, the relationship between leaf nodes and internal nodes is represented by the graph given below. What is the value of $'m'$? Take necessary approximations to nearest integer if required (Integer type)
For a given $m$-ary tree, the relationship between leaf nodes and internal nodes is represented by the graph given below. What is the value of $'m'$? Take necessary appro...
User Avatar
0 votes
2 answers
49
In a 3-array tree if internal nodes have exactly 3 children,the number of leaf nodes will be __ ?
In a 3-array tree if internal nodes have exactly 3 children,the number of leaf nodes will be __ ? Does it vary for binary tree? What do you mean by internal nodes? Non root node and leaf node?
In a 3-array tree if internal nodes have exactly 3 children,the number of leaf nodes will be __ ?Does it vary for binary tree?What do you mean by internal nodes? Non roo...
User Avatar
2 votes
3 answers
50
NIELIT 2018-72
____ number of leaf nodes in a rooted tree of $n$ nodes, where each node is having $0$ or $3$ children $\frac{n}{2}$ $\frac{(2n+1)}{3}$ $\frac{(n-1)}{n}$ $(n-1)$
____ number of leaf nodes in a rooted tree of $n$ nodes, where each node is having $0$ or $3$ children$\frac{n}{2}$$\frac{(2n+1)}{3}$$\frac{(n-1)}{n}$$(n-1)$
User Avatar
0 votes
0 answers
51
SELF DOUBT BINARY SEARCH
https://gateoverflow.in/132037/self-doubt-in-binary-search-algo DOUBT : THIS QUESTION 10 ELEMENTS ARE IN ARRAY AND SORTED THEN HOW CAN WE DRAW A BALANCED TREE BECZ IT IS ALWAYS GIVING SKEWED TREE.
https://gateoverflow.in/132037/self-doubt-in-binary-search-algoDOUBT : THIS QUESTION 10 ELEMENTS ARE IN ARRAY AND SORTED THEN HOW CAN WE DRAW A BALANCED TREE BECZ IT I...
User Avatar
0 votes
1 answer
52
#made esay
how many different trees possible with 5 nodes?
how many different trees possible with 5 nodes?
User Avatar
0 votes
0 answers
53
AVL TREES
Please suggest how to learn AVL rotation in AVL trees and some good practice questions or link would be so much helpful Thanks
Please suggest how to learn AVL rotation in AVL trees and some good practice questions or link would be so much helpfulThanks
User Avatar
1 votes
2 answers
54
DBMS basic test1
User Avatar
0 votes
0 answers
55
Data structures
User Avatar
Page: