Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
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)$
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...
14.7k
views
answered
Oct 19, 2022
DS
gate1998
data-structures
tree
normal
+
–
1
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.
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 inferre...
2.9k
views
answered
Jul 13, 2022
Analytical Aptitude
gate2018-me-1
general-aptitude
analytical-aptitude
statements-follow
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register