In a full complete binary tree, the vertices other than root have degree:
2015
In a full complete binary tree, the vertices other than root have degree:
- A.
1
- B.
2
- C.
3
- D.
1 or 3
- E.
Question not attempted
Attempted by 351 students.
Show answer & explanation
Correct answer: D
FULL COMPLETE BINARY TREE although its not a standard term sometimes it casually use it to mean a perfect binary tree its different from complete binary tree
Full complete binary tree charecteristics :
1. Every node has either 0 or 2 children (no node has exactly one child).
2. Last level filled left to right
Complete binary tree charecteristics :
1. All levels are filled except possibly the last
2. Last level filled left to right
In a full complete binary tree, every non-root vertex is either a leaf or an internal node.
Leaf nodes have one parent and no children, so their degree is 1.
Internal nodes have one parent and two children, so their degree is 3.
Therefore, the degree of non-root vertices is either 1 or 3.
हिन्दी उत्तर:
एक पूर्ण द्विआधारी वृक्ष में, प्रत्येक गैर-मूल शीर्ष पत्ति या आंतरिक नोड होता है।
पत्ति शीर्षों में एक माता-पिता और कोई बच्चा नहीं होता है, इसलिए उनकी कोटि 1 होती है।
आंतरिक नोड्स में एक माता-पिता और दो बच्चे होते हैं, इसलिए उनकी कोटि 3 होती है।
इसलिए, गैर-मूल शीर्षों की कोटि या तो 1 या 3 होती है।