Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged tree
21
votes
1
answer
151
GATE CSE 1998 | Question: 21
Derive a recurrence relation for the size of the smallest AVL tree with height $h$. What is the size of the smallest AVL tree with height $8$?
Derive a recurrence relation for the size of the smallest AVL tree with height $h$.What is the size of the smallest AVL tree with height $8$?
Kathleen
4.2k
views
Kathleen
asked
Sep 26, 2014
DS
gate1998
data-structures
tree
descriptive
numerical-answers
+
–
29
votes
11
answers
152
GATE CSE 1998 | Question: 2.11
A complete $n$-ary tree is one in which every node has $0$ or $n$ sons. If $x$ is the number of internal nodes of a complete $n$-ary tree, the number of leaves in it is given by $x(n-1) +1$ $xn-1$ $xn +1$ $x(n+1)$
A complete $n$-ary tree is one in which every node has $0$ or $n$ sons. If $x$ is the number of internal nodes of a complete $n$-ary tree, the number of leaves in it is g...
Kathleen
14.7k
views
Kathleen
asked
Sep 25, 2014
DS
gate1998
data-structures
tree
normal
+
–
37
votes
5
answers
153
GATE CSE 1998 | Question: 1.24
Which of the following statements is false? A tree with a $n$ nodes has $(n – 1)$ edges A labeled rooted binary tree can be uniquely constructed given its postorder and preorder traversal results. A complete binary tree with $n$ internal nodes has $(n + 1)$ leaves. The maximum number of nodes in a binary tree of height h is $2^{h+1} - 1$
Which of the following statements is false? A tree with a $n$ nodes has $(n – 1)$ edges A labeled rooted binary tree can be uniquely constructed given its postorder and...
Kathleen
16.9k
views
Kathleen
asked
Sep 25, 2014
DS
gate1998
data-structures
tree
multiple-selects
normal
+
–
22
votes
8
answers
154
GATE CSE 2005 | Question: 36
In a complete $k$-ary tree, every internal node has exactly $k$ children. The number of leaves in such a tree with $n$ internal node 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 node is:$nk$$(n-1)k + 1$$n(k-1) +1$$n(k-1)...
Kathleen
23.1k
views
Kathleen
asked
Sep 22, 2014
DS
gatecse-2005
data-structures
tree
normal
+
–
31
votes
8
answers
155
GATE CSE 2007 | Question: 43
A complete $n-ary$ tree is a tree in which each node has $n$ children or no children. Let $I$ be the number of internal nodes and $L$ be the number of leaves in a complete $n-ary$ tree. If $L = 41$ and $I = 10$, what is the value of $n$? $3$ $4$ $5$ $6$
A complete $n-ary$ tree is a tree in which each node has $n$ children or no children. Let $I$ be the number of internal nodes and $L$ be the number of leaves in a complet...
Kathleen
25.9k
views
Kathleen
asked
Sep 21, 2014
DS
gatecse-2007
data-structures
tree
normal
+
–
19
votes
3
answers
156
GATE CSE 2004 | Question: 6
Level order traversal of a rooted tree can be done by starting from the root and performing preorder traversal in-order traversal depth first search breadth first search
Level order traversal of a rooted tree can be done by starting from the root and performingpreorder traversalin-order traversaldepth first searchbreadth first search
Kathleen
6.5k
views
Kathleen
asked
Sep 18, 2014
DS
gatecse-2004
data-structures
tree
easy
+
–
35
votes
5
answers
157
GATE CSE 2002 | Question: 2.9
The number of leaf nodes in a rooted tree of n nodes, with each node having $0$ or $3$ children is: $\frac{n}{2}$ $\frac{(n-1)}{3}$ $\frac{(n-1)}{2}$ $\frac{(2n+1)}{3}$
The number of leaf nodes in a rooted tree of n nodes, with each node having $0$ or $3$ children is:$\frac{n}{2}$$\frac{(n-1)}{3}$$\frac{(n-1)}{2}$$\frac{(2n+1)}{3}$
Kathleen
31.1k
views
Kathleen
asked
Sep 15, 2014
DS
gatecse-2002
data-structures
tree
normal
+
–
28
votes
5
answers
158
GATE CSE 1992 | Question: 02,vii
A $2-3$ tree is such that All internal nodes have either $2$ or $3$ children All paths from root to the leaves have the same length The number of internal nodes of a $2-3$ tree having $9$ leaves could be $4$ $5$ $6$ $7$
A $2-3$ tree is such thatAll internal nodes have either $2$ or $3$ childrenAll paths from root to the leaves have the same lengthThe number of internal nodes of a $2-3$ t...
Kathleen
9.0k
views
Kathleen
asked
Sep 12, 2014
DS
gate1992
tree
data-structures
normal
multiple-selects
+
–
Page:
« prev
1
2
3
4
5
6
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register