Register

UGC NET CSE | July 2018 | Part 2 | Question: 29

• recategorized
9,573 views

2 Answers

0 votes
0 votes

Option B

In a complete n-ary tree, $L = (n-1) * I + 1$   where L = No. of leaves, I = No. of Internel nodes

Here n = 5, I = 8

Therefore,  L = (5-1) * 8 + 1 = 4 * 8 + 1 = 33

 

User Avatar
0 votes
0 votes
The question should ask about total no. Of leaf nodes which is 33

No. Of leaf nodes=(m-1)*I+1

                              =(5-1)*8+1

                             =33
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
3 answers
1
Pooja Khatri asked Jul 13, 2018
3,427 views
UGC NET CSE | July 2018 | Part 2 | Question: 22
Consider the array A=<4, 1, 3, 2, 16, 9, 10, 14, 8, 7>. After building heap from the array A, the depth of the heap and the right child of max-heap are ______ and _____ respectively (Root is at level 0). 3, 14 3, 10 4, 14 4, 10
Consider the array A=<4, 1, 3, 2, 16, 9, 10, 14, 8, 7>. After building heap from the array A, the depth of the heap and the right child of max-heap are ______ and _____ r...
User Avatar
0 votes
0 votes
2 answers
2
Pooja Khatri asked Jul 13, 2018
8,953 views
UGC NET CSE | July 2018 | Part 2 | Question: 23
A hash function h defined h(key)=key mod 7, with linear probing, is used to insert the keys 44, 45, 79, 55, 91, 18, 63 into a table indexed from 0 to 6. What will be the location of key 18? 3 4 5 6
A hash function h defined h(key)=key mod 7, with linear probing, is used to insert the keys 44, 45, 79, 55, 91, 18, 63 into a table indexed from 0 to 6. What will be the ...
User Avatar
0 votes
0 votes
2 answers
3
Pooja Khatri asked Jul 13, 2018
2,603 views
UGC NET CSE | July 2018 | Part 2 | Question: 24
Which of the following algorithms solves the single-source shortest paths? Prim's algorithm Floys-Warshall algorithm Johnson's algorithm Dijkstra's algorithm
Which of the following algorithms solves the single-source shortest paths?Prim's algorithmFloys-Warshall algorithmJohnson's algorithmDijkstra's algorithm
User Avatar
0 votes
0 votes
8 answers
4
Pooja Khatri asked Jul 13, 2018
3,552 views
UGC NET CSE | July 2018 | Part 2 | Question: 26
A binary search tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 19 leaves: cannot have more than 37 nodes has exactly 37 nodes has exactly 35 nodes cannot have more than 35 nodes
A binary search tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 19 leaves:cannot have more than...
User Avatar
Link Copied!