Aspire's Library
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations - NIMCET
Study Stuff for MCA Examinations - NIMCET
Previous Year Question (PYQs)
Which of the followings are true for a complete binary tree?
A. It always has odd number of vertices.
B. With $n$ internal vertices, it has $n+1$ leaves.
C. With $l$ leaves it has $l-1$ internal vertices.
D. With $2n-1$ vertices, it has $n$ leaves.
A. It always has odd number of vertices.
B. With $n$ internal vertices, it has $n+1$ leaves.
C. With $l$ leaves it has $l-1$ internal vertices.
D. With $2n-1$ vertices, it has $n$ leaves.
Solution
Properties of complete/full binary tree:
• If internal nodes = $n$ → leaves = $n+1$ ✔
• If leaves = $l$ → internal nodes = $l-1$ ✔
• Total vertices = $2n-1$ when leaves = $n$ ✔
• Such trees always have odd number of vertices ✔
Thus all statements are correct.
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Ask Your Question or Put Your Review.
