📚 Question Bank Q58 — Programming and Data Structure
Tags
Programming and Data Structure
Q58. Marks: +2.0 UGC NET Paper 2: Computer Science 2020
A complete n-ary tree is a tree in which each node has n children or no children. Let I be the number of internal nodes and L be the number of leaves in a complete n-ary tree. If L = 41, and I = 10, What is the value of n ?
1.3
2.4
3.5 ✓ Correct
4.6
📄 All “Programming and Data Structure” questions across papers
🏷 Change Tag for this Question