Register

DRDO CSE 2022 Paper 1 | Question: 28

• recategorized by
292 views

2 Answers

0 votes
0 votes
minimum number of nodes = N+1 (When Tree is Skewed Binary Tree)

Maximum number of nodes = 2^(N+1) - 1 (When Tree is Full Binary Tree)
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

3 votes
3 votes
0 answers
2
admin asked Dec 15, 2022
388 views
DRDO CSE 2022 Paper 1 | Question: 9
Count the number of perfect matchings in the bipartite graph whose adjacency matrix $\text{A}$ is as follows. \[\left[\begin{array}{lll} 1 & 1 & 0 \\ 0 & 1 & 1 \\ 1 & 1 & 1 \end{array}\right]\]
Count the number of perfect matchings in the bipartite graph whose adjacency matrix $\text{A}$ is as follows.\[\left[\begin{array}{lll}1 & 1 & 0 \\0 & 1 & 1 \\1 & 1 & 1\e...
User Avatar
1 votes
1 votes
1 answer
3
admin asked Dec 15, 2022
316 views
DRDO CSE 2022 Paper 1 | Question: 10
Given a tree $\text{T}$ and $\lambda \geq 2$ colours $\left(c_{1}, c_{2}, \ldots, c_{\lambda}\right),$ how many proper colourings of the tree $\text{T}$ are possible?
Given a tree $\text{T}$ and $\lambda \geq 2$ colours $\left(c_{1}, c_{2}, \ldots, c_{\lambda}\right),$ how many proper colourings of the tree $\text{T}$ are possible?
User Avatar
1 votes
1 votes
1 answer
4
admin asked Dec 15, 2022
333 views
DRDO CSE 2022 Paper 1 | Question: 25
Simplify the Boolean function $F=W^{\prime} X^{\prime} Y^{\prime}+W X^{\prime} Y^{\prime}+W^{\prime} X Y Z^{\prime}+X^{\prime} Y Z^{\prime}$
Simplify the Boolean function $F=W^{\prime} X^{\prime} Y^{\prime}+W X^{\prime} Y^{\prime}+W^{\prime} X Y Z^{\prime}+X^{\prime} Y Z^{\prime}$
User Avatar
Link Copied!