UGC NET Previous Year Question Paper Download | UGC NET Online Coaching Classes for Computer Science: 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? - Solved Computer Science - June 2020 - NTA NET ASPIRANT ACADEMY

Saturday, April 10, 2021

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? - Solved Computer Science - June 2020 - NTA NET ASPIRANT ACADEMY

NTA NET SOLVED COMPUTER SCIENCE - JUNE 2020

Answer: 5 (Option D)

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)