Dark Mode

Answers by Shreya2002

0 votes

1

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)$

answered in DS Oct 19, 2022

12.7k views

0 votes

2

GATE2018 ME-1: GA-10
Consider the following three statements: Some roses are red. All red flowers fade quickly. Some roses fade quickly. Which of the following statements can be logically inferred from the above statements? If (i) is true and (ii) is false, then (iii) is false. If (i) is true and (ii ... . If (i) and (ii) are true, then (iii) is true. If (i) and (ii) are false, then (iii) is false.

answered in Analytical Aptitude Jul 13, 2022

2.0k views