Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged tree
1
votes
0
answers
91
apset-2017 paper-2
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 length The number of internal nodes of 2-3 tree having 9 leaves could be (A) 4 (B) 5 (C) 6 (D) 8
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...
Knn
341
views
Knn
asked
Aug 2, 2017
DS
tree
+
–
1
votes
1
answer
92
trees in data structure
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 tree ?
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...
cjoshi
541
views
cjoshi
asked
Jun 26, 2017
Programming in C
tree
+
–
1
votes
1
answer
93
Test by Bikram | Mock GATE | Test 4 | Question: 31
An $m-ary$ tree is a tree in which every node has at most $m$ children. In an $m-ary$ tree with $p$ nodes and height $l$ $($starting from $0)$, which of the following is the tightest upper bound for the maximum number of leaves as a function of $l$, $m$, and $p$? $\lg m \times p$ $\lg m \times l \times \lg p$ $l^m$ $m^l$
An $m-ary$ tree is a tree in which every node has at most $m$ children. In an $m-ary$ tree with $p$ nodes and height $l$ $($starting from $0)$, which of the following is ...
Bikram
360
views
Bikram
asked
May 14, 2017
DS
tbb-mockgate-4
data-structures
tree
binary-tree
+
–
15
votes
3
answers
94
ISI Entrance Exam MTech (CS)
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$?
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$?
Shreya Roy
2.3k
views
Shreya Roy
asked
Apr 5, 2017
Graph Theory
isi2016
graph-theory
tree
descriptive
+
–
3
votes
3
answers
95
Trees
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?
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?
Srinivas Rao
946
views
Srinivas Rao
asked
Apr 4, 2017
DS
data-structures
tree
descriptive
+
–
38
votes
7
answers
96
GATE CSE 2017 Set 1 | Question: 20
Let $T$ be a tree with $10$ vertices. The sum of the degrees of all the vertices in $T$ is ________
Let $T$ be a tree with $10$ vertices. The sum of the degrees of all the vertices in $T$ is ________
Arjun
18.7k
views
Arjun
asked
Feb 14, 2017
DS
gatecse-2017-set1
data-structures
tree
easy
numerical-answers
+
–
1
votes
2
answers
97
Test by Bikram | Mock GATE | Test 3 | Question: 21
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 ( z+1 \right )$+ 3$ $2z$ $3z$ $2z + 1$
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...
Bikram
293
views
Bikram
asked
Feb 9, 2017
GATE
tbb-mockgate-3
data-structures
tree
counting
+
–
0
votes
1
answer
98
Test by Bikram | Mock GATE | Test 3 | Question: 9
A complete binary tree can be stored in an array. If index starts at $1$, to access the child of $i^{th}$ node, the _____$^{th}$ and _____ $^{th}$ index of array needs to be used. $2i - $ and $2i$ $2i$ and $2i + 1$ $2i + 1$ and $2i + 2$ $2i - 1$ and $2i + 1$
A complete binary tree can be stored in an array.If index starts at $1$, to access the child of $i^{th}$ node, the _____$^{th}$ and _____ $^{th}$ index of array needs t...
Bikram
237
views
Bikram
asked
Feb 9, 2017
GATE
tbb-mockgate-3
data-structures
tree
binary-tree
+
–
0
votes
3
answers
99
Data Structure In-Order Predecessor
If a node in a BST has two children, then its in-order predecessor has a) No left child b) No right child c) 2 children d) no child
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
smartmeet
6.9k
views
smartmeet
asked
Feb 8, 2017
DS
data-structures
tree
tree-traversal
+
–
2
votes
7
answers
100
UGC NET CSE | January 2017 | Part 3 | Question: 32
Any decision tree that sorts n elements has height ____ $\Omega (\lg \: n)$ $\Omega (n)$ $\Omega (n \: \lg \: n)$ $\Omega (n^2)$
Any decision tree that sorts n elements has height ____$\Omega (\lg \: n)$$\Omega (n)$$\Omega (n \: \lg \: n)$$\Omega (n^2)$
go_editor
7.5k
views
go_editor
asked
Jan 31, 2017
Algorithms
ugcnetcse-jan2017-paper3
algorithms
tree
+
–
0
votes
2
answers
101
data structure tree doubt
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______
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______
iita
781
views
iita
asked
Jan 24, 2017
Programming in C
n-ary
tree
+
–
0
votes
1
answer
102
Test by Bikram | Mock GATE | Test 2 | Question: 37
Which of these statements is not true about an $AVL$ tree $T$ containing $n$ nodes? Rotations may be required during key insertion to keep $T$ balanced. The height of $T$ cannot exceed $1.5$ * $\log 2^{n}$ . And It is ... $ can be used to perform order statistic searches in $O$\left ( \lg n \right )$ asymptotic algorithmic complexity.
Which of these statements is not true about an $AVL$ tree $T$ containing $n$ nodes?Rotations may be required during key insertion to keep $T$ balanced.The height of $T$ c...
Bikram
509
views
Bikram
asked
Jan 24, 2017
GATE
tbb-mockgate-2
data-structures
tree
avl-tree
+
–
1
votes
1
answer
103
Test by Bikram | Mock GATE | Test 2 | Question: 32
Suppose that six keys are inserted into an unbalanced binary search tree in the following order: $4, 6, 3, 8, 2$, and $5$ ... without adding another level to the tree. I and II only I and III only II and III only I, II, and III
Suppose that six keys are inserted into an unbalanced binary search tree in the following order: $4, 6, 3, 8, 2$, and $5$.Then which of the following statements is/are co...
Bikram
310
views
Bikram
asked
Jan 24, 2017
DS
tbb-mockgate-2
data-structures
binary-search-tree
tree
+
–
1
votes
2
answers
104
Test by Bikram | Mock GATE | Test 2 | Question: 20
Given a binary search tree $T$, what is the path from $a$ node $x$ to its successor $y$, assuming that both $x$ and $y$ exist in $T$? if $x$ has a right child, then $y$ is the right child of $x$; otherwise, $y$ is the parent of $x$ ... $y$ is the parent of $x$; otherwise, $y$ is the parent of $x's$ first ancestor $z$ such that $z$ is a left child
Given a binary search tree $T$, what is the path from $a$ node $x$ to its successor $y$, assuming that both $x$ and $y$ exist in $T$?if $x$ has a right child, then $y$ is...
Bikram
445
views
Bikram
asked
Jan 24, 2017
GATE
tbb-mockgate-2
data-structures
tree
binary-tree
binary-search-tree
+
–
1
votes
1
answer
105
MadeEasy CBT 2017: Programming & DS - Trees
Devwritt
1.6k
views
Devwritt
asked
Jan 22, 2017
DS
made-easy-test-series
cbt-2017
data-structures
tree
+
–
2
votes
1
answer
106
Virtual Gate Test Series: Programming & DS - Tree
The minimum number of vertices having degree $1$ in a tree of at least $10$ vertices is ______________. If we consider this question, then the first answer comes in our mind is $'2',$ right? But what if Tree isn't binary? if the root node has $9$ leaf nodes, so all those nodes having degree $1,$ right$?$ So the answer could be$:9$
The minimum number of vertices having degree $1$ in a tree of at least $10$ vertices is ______________.If we consider this question, then the first answer comes in our mi...
smartmeet
453
views
smartmeet
asked
Jan 18, 2017
DS
data-structures
tree
virtual-gate-test-series
+
–
0
votes
1
answer
107
Test by Bikram | Mock GATE | Test 1 | Question: 27
Consider the following algorithm: ORDER (T) begin if (T!=NULL) then begin ORDER (LPTR(T)) PRINT (DATA(T)) ORDER (RPTR(T)) end return end where LPTR: left pointer RPTR: right pointer T: given tree This above algorithm is used ... in in-order, in a recursive manner Traverse the tree in post-order in a recursive manner Do not Traverse the tree at all
Consider the following algorithm:ORDER (T) begin if (T!=NULL) then begin ORDER (LPTR(T)) PRINT (DATA(T)) ORDER (RPTR(T)) end return end where LPTR: left pointer RPTR: rig...
Bikram
367
views
Bikram
asked
Jan 16, 2017
GATE
tbb-mockgate-1
data-structures
tree
+
–
6
votes
1
answer
108
order of leaf node in b+ tree??
which formula should we use for calculating LEAF node in B+ tree? I. n*(K+r)+b<=block size where n=no of keys k=key size,r=record pointer,b=block pointer II. (n-1)(K+r)+b<=block size
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...
firki lama
5.9k
views
firki lama
asked
Jan 14, 2017
Databases
databases
b-tree
tree
+
–
4
votes
1
answer
109
Virtual Gate Test Series: Programming & DS - Binary Search Tree
What is the correct answer?
What is the correct answer?
Purple
694
views
Purple
asked
Jan 12, 2017
DS
data-structures
tree
binary-search-tree
virtual-gate-test-series
+
–
4
votes
2
answers
110
DS-BST
If preorder of a BST is passed as an argument to the above function. Function returns 1 if, a)All the leaf nodes of the tree are at same level b) All the nodes of the tree have atmost 1 child c) True is a complete binary tree, where the nodes at each level are completely filled d) None of these
If preorder of a BST is passed as an argument to the above function. Function returns 1 if,a)All the leaf nodes of the tree are at same levelb) All the nodes of the tree ...
srestha
896
views
srestha
asked
Jan 12, 2017
DS
data-structures
tree
+
–
8
votes
2
answers
111
MadeEasy Subject Test: Programming & DS - Binary Search Tree
The number of BST's possible with $6$ nodes numbered $1$,$2$,$3$,$4$,$5$ and $6$ with exactly one leaf node are ....................... OR The number of BST's possible with $6$ nodes numbered $1$,$2$,$3$,$4$,$5$ and $6$ having a height of $5$ are .................… ( note :- height of a root is 0 )
The number of BST's possible with $6$ nodes numbered $1$,$2$,$3$,$4$,$5$ and $6$ with exactly one leaf node are .......................ORThe number of BST's possible with...
Çșȇ ʛấẗẻ
1.8k
views
Çșȇ ʛấẗẻ
asked
Jan 6, 2017
DS
data-structures
made-easy-test-series
tree
binary-search-tree
+
–
1
votes
2
answers
112
DS AVL Trees
Consider the tree T in which left subtree contains half of the maximum number of nodes possible in the avl tree of height 6 and right subtree contains one 3rd of the minimum number of nodes possible in Avl tree of height 6.What will be total number of nodes in T? Edit:- I am getting 75.5 as answer.Now i am not sure whether to pick 75 ot 76
Consider the tree T in which left subtree contains half of the maximum number of nodes possible in the avl tree of height 6 and right subtree contains one 3rd of the mini...
rahul sharma 5
1.2k
views
rahul sharma 5
asked
Dec 18, 2016
Programming in C
data-structures
tree
avl-tree
+
–
18
votes
1
answer
113
left biasing and right biasing in B+ tree insertion
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 ?
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 ?
Akanksha Kesarwani
6.3k
views
Akanksha Kesarwani
asked
Dec 10, 2016
Databases
databases
b-tree
tree
+
–
11
votes
2
answers
114
GATE CSE 1990 | Question: 13a
Consider the height-balanced tree $T_{t}$ with values stored at only the leaf nodes, shown in Fig$.4.$ (i) Show how to merge to the tree, $T_{1}$ elements from tree $T_{2}$ shown in Fig$.5$ using node D of tree $T_{1}$. (ii) What is the ... where $T_{1}$ and $T_{2}$ are of height $h_{1}$ and $h_{2}$ respectively, assuming that rotation schemes are given. Give reasons.
Consider the height-balanced tree $T_{t}$ with values stored at only the leaf nodes, shown in Fig$.4.$(i) Show how to merge to the tree, $T_{1}$ elements from tree $T_{2}...
makhdoom ghaya
3.8k
views
makhdoom ghaya
asked
Nov 25, 2016
DS
gate1990
data-structures
tree
descriptive
+
–
2
votes
1
answer
115
complexity of different trees
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
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
Sanjay Sharma
1.4k
views
Sanjay Sharma
asked
Nov 23, 2016
Algorithms
data-structures
tree
binary-search
time-complexity
descriptive
+
–
4
votes
1
answer
116
Trees
thor
543
views
thor
asked
Nov 21, 2016
DS
tree
binary-tree
+
–
1
votes
1
answer
117
Trees
There are nn-2 labeled trees with n vertices(n>2) Can anyone explain it with complete proof?
There are nn-2 labeled trees with n vertices(n>2)Can anyone explain it with complete proof?
Prajwal Bhat
465
views
Prajwal Bhat
asked
Oct 16, 2016
Programming in C
tree
graph-theory
+
–
2
votes
3
answers
118
GATE Overflow | Data Structures | Test 1 | Question: 20
Consider a complete graph on 10 vertices. Minimum no. of edge removals required to make a tree out of it will be ____
Consider a complete graph on 10 vertices. Minimum no. of edge removals required to make a tree out of it will be ____
Arjun
595
views
Arjun
asked
Oct 10, 2016
DS
go-ds-1
data-structures
tree
numerical-answers
+
–
2
votes
3
answers
119
GATE Overflow | Data Structures | Test 1 | Question: 7
A $2-3$ tree is a tree such that all internal nodes have either 2 or 3 children all paths from root to the leaves have the same length. The maximum number of nodes of a 2-3 tree having 9 leaves is ___
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 ...
Arjun
1.1k
views
Arjun
asked
Oct 10, 2016
DS
go-ds-1
data-structures
numerical-answers
tree
+
–
1
votes
2
answers
120
UGC NET CSE | June 2010 | Part 2 | Question: 32
Which of the following expression is represented by the parse tree ? $(A + B) ^{*} C$ $A + ^{*} BC$ $A + B * C$ $A * C + B$
Which of the following expression is represented by the parse tree ?$(A + B) ^{*} C$$A + ^{*} BC$$A + B * C$$A * C + B$
makhdoom ghaya
2.1k
views
makhdoom ghaya
asked
Sep 16, 2016
DS
ugcnetcse-june2010-paper2
data-structures
tree
+
–
Page:
« prev
1
2
3
4
5
6
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register