Dark Mode

Recent questions tagged tree

2 votes

1 answer

121

UGC NET CSE | June 2010 | Part 2 | Question: 23
In a complete binary tree of n nodes, how far are the two most distant nodes ? Assume each edge in the path counts as ! About $\log_{2} n$ About $2 \log_{2} n$ About $n \log_{2} n$ About $2n$

makhdoom ghaya asked in DS Sep 15, 2016

by makhdoom ghaya

5.2k views

6 votes

4 answers

122

DSA
a 4-ary tree has either 4 or 0 children,What is the total number of nodes when there are 20 leaf node?

Aboveallplayer asked in Programming in C Sep 3, 2016

by Aboveallplayer

2.1k views

3 votes

2 answers

123

UGC NET CSE | June 2011 | Part 2 | Question: 21
The number of different trees with $8$ nodes is 256 255 248 None of these

makhdoom ghaya asked in Others Aug 23, 2016

by makhdoom ghaya

3.1k views

2 votes

1 answer

124

Cormen page 155
The children's subtrees each have size at most 2n/3 - the worst case occurs when the last row of the tree is exactly half full Plz explain this so i get a picture in my head

Shivangi Verma asked in DS Aug 19, 2016

by Shivangi Verma

666 views

3 votes

3 answers

125

UGC NET CSE | June 2016 | Part 2 | Question: 23
Suppose you are given a binary tree with n nodes, such that each node has exactly eiter zero or two children. The maximum height of the tree will be $\frac{n}{2}-1$ $\frac{n}{2}+1$ $(n-1)/2$ $(n+1)/2$

go_editor asked in DS Aug 16, 2016

14.1k views

3 votes

1 answer

126

UGC NET CSE | December 2015 | Part 2 | Question: 37
The number of disk pages access in B-tree search, where h is height, n is the number of keys and t is the minimum degree, is $\theta (\log_n h*t)$ $\theta (\log_t n*h)$ $\theta (\log_h n)$ $\theta (\log_t n)$

go_editor asked in Algorithms Aug 8, 2016

3.0k views

4 votes

1 answer

127

UGC NET CSE | December 2015 | Part 2 | Question: 5
A tree with n vertices is called graceful, if its vertices can be labelled with integers 1, , ..., n such that the absolute value of the difference of the labels of adjacent vertices are all different. Which of the following trees are graceful? a and b b and c a and c a, b,and c

go_editor asked in DS Aug 3, 2016

3.9k views

3 votes

1 answer

128

UGC NET CSE | Junet 2015 | Part 2 | Question: 4
Consider the following statements: Depth-first search is used to traverse a rooted tree Pre-order, Post-order and Inorder are used to list the vertices of an ordered rooted tree. Huffman's algorithm is used to find an optimal binary tree with given weights Topological ... $\text{iii and iv}$ $\text{i, ii, and iii}$ $\text{i, ii, iii, and iv}$

go_editor asked in Algorithms Jul 30, 2016

2.2k views

4 votes

3 answers

129

UGC NET CSE | December 2014 | Part 2 | Question: 02
A certain tree has two vertices of degree $4$, one vertex of degree $3$ and one vertex of degree $2$. If the other vertices have degree $1$, how many vertices are there in the graph ? $5$ $n – 3$ $20$ $11$

makhdoom ghaya asked in DS Jul 15, 2016

by makhdoom ghaya

15.9k views

1 vote

1 answer

130

UGC NET CSE | December 2012 | Part 2 | Question: 33
Consider the tree given below: Using the property of eccentricity of a vertex, find every vertex that is the centre of the given tree: d & h c & k g, b, c, h, i, m c & h

go_editor asked in Graph Theory Jul 11, 2016

4.6k views

3 votes

2 answers

131

UGC NET CSE | December 2012 | Part 2 | Question: 16
In which tree, for every node the height of its left subtree and right subtree differ almost by 1? Binary Search Tree AVL Tree Threaded Binary Tree Complete Binary Tree

go_editor asked in DS Jul 8, 2016

6.6k views

1 vote

1 answer

132

UGC NET CSE | June 2012 | Part 3 | Question: 36
Number of binary trees formed with 5 nodes are 32 36 120 42

go_editor asked in DS Jul 7, 2016

8.2k views

3 votes

2 answers

133

UGC NET CSE | June 2012 | Part 2 | Question: 50
To represent hierarchical relationship between elements, which data structure is suitable? Dequeue Priority Tree All of the above

go_editor asked in DS Jul 5, 2016

22.5k views

0 votes

1 answer

134

UGC NET CSE | June 2012 | Part 2 | Question: 13
Leaves of which of the following trees are at the same level? A. Binary tree B. B-tree C. AVL-tree D. Expression tree

shivani2010 asked in DS Jun 15, 2016

3.4k views

9 votes

7 answers

135

ISRO2011-19
If node A has three siblings and B is parent of A, what is the degree of A? 0 3 4 5

shibu asked in DS Jun 15, 2016

by shibu

7.4k views

4 votes

1 answer

136

Splay Tree
The amortized time complexity to perform ______ operation(s) in Splay trees is $O(\log n)$. Search Search and Insert Search and Delete Search, insert and delete

shivani2010 asked in DS Jun 9, 2016

1.1k views

2 votes

1 answer

137

a graph with n vertices and n-1 edges that is not a tree is called

Anuanu asked in Graph Theory Jun 2, 2016

by Anuanu

12.3k views

7 votes

4 answers

138

number of ordered trees
The number of possible ordered trees with 3 nodes A, B, C is: (a) 16 (b) 12 (c) 6 (d) 10 what is ordered tree alignment?

padmaja asked in DS May 28, 2016

18.9k views

4 votes

2 answers

139

CMI2012-A-02
Let $T$ be a tree on 100 vertices. Let $n_i$ be the number of vertices in $T$ which have exactly $i$ neighbors. Let $s= \Sigma_{i=1}^{100} i . n_i$ Which of the following is true? $s=99$ $s=198$ $99 \: < \: s \: < \: 198$ None of the above

go_editor asked in Graph Theory May 22, 2016

844 views

0 votes

1 answer

140

ugc

Sanjay Sharma asked in Algorithms May 3, 2016

by Sanjay Sharma

350 views

2 votes

3 answers

141

Virtual Gate Test Series: Programming & DS - AVL Tree
Insert the given values in the order in initially empty $\text{AVL}$ tree. $\text{34,21,10,27,24,43,15,6}$ What is the value at the root of the tree$?$

learncp asked in DS Jan 26, 2016

768 views

3 votes

0 answers

142

Total running time of 'm' access operation in a Splay tree .. [GATEFORUM-TEST-DSA]

Vinay Yadav asked in DS Nov 26, 2015

546 views

29 votes

8 answers

143

TIFR CSE 2012 | Part B | Question: 15
Let $T$ be a tree of $n$ nodes. Consider the following algorithm, that constructs a sequence of leaves $u_{1}, u_{2}...$. Let $u_{1}$ be some leaf of tree. Let $u_{2}$be a leaf that is farthest from $u_{1}$ ... . For the same tree, the distance between the last two vertices visited can be different, based on the choice of the first leaf $u_{1}$.

makhdoom ghaya asked in DS Nov 2, 2015

by makhdoom ghaya

3.8k views

9 votes

9 answers

144

ISRO2014-73
How many different trees are there with four nodes $\text{A, B, C}$ and $\text{D}?$ $30$ $60$ $90$ $120$

ajit asked in DS Sep 23, 2015

by ajit

14.6k views

0 votes

2 answers

145

PLEASE SOLVE THIS
The maximum number of nodes in a B+ tree with order 4 and height 6 are ____________ I think it should be $1+4+4^{2}+4^{3}+4^{4}+4^{5}+4^{6}$= >$\frac{4^{7}-1}{4-1}$=>5461

Suvam Chatterjee asked in Databases Sep 9, 2015

by Suvam Chatterjee

603 views

5 votes

1 answer

146

UGC NET CSE | December 2013 | Part 2 | Question: 36
How many edges are there in a forest of t-trees containing a total of n vertices ? n + t n – t n ∗ t nt

Shimpy Goyal asked in Graph Theory Jun 26, 2015

by Shimpy Goyal

3.6k views

2 votes

4 answers

147

UGC NET CSE | December 2012 | Part 2 | Question: 25
Suppose that someone starts with a chain letter. Each person who receives the letter is asked to send it on to $4$ other people. Some people do this, while some do not send any letter. How many people have seen the letter, including the first person, if none ... out the letter? $122$ & $22$ $111$ & $11$ $133$ & $33$ $144$ & $44$

Shimpy Goyal asked in DS Jun 23, 2015

by Shimpy Goyal

6.7k views

17 votes

3 answers

148

GATE CSE 1994 | Question: 5
A $3-\text{ary}$ tree is a tree in which every internal node has exactly three children. Use induction to prove that the number of leaves in a $3-\text{ary}$ tree with $n$ internal nodes is $2(n+1)$.

Kathleen asked in DS Oct 5, 2014

12.9k views

56 votes

7 answers

149

GATE CSE 2014 Set 3 | Question: 41
Consider the pseudocode given below. The function $DoSomething()$ takes as argument a pointer to the root of an arbitrary tree represented by the $leftMostChild-rightSibling$ representation. Each node of the tree is of type $treeNode$. typedef struct ... height of the tree. number of nodes without a right sibling in the tree. number of leaf nodes in the tree

go_editor asked in DS Sep 28, 2014

19.8k views

50 votes

9 answers

150

GATE CSE 2014 Set 3 | Question: 12
Consider the following rooted tree with the vertex labeled $P$ as the root: The order in which the nodes are visited during an in-order traversal of the tree is $SQPTRWUV$ $SQPTUWRV$ $SQPTWUVR$ $SQPTRUWV$

go_editor asked in DS Sep 28, 2014

16.4k views

Page:

« prev
1
2
3
4
5
6
next »

Recent questions tagged tree