जॉइन Examsbookउत्तर : 1. "Dn = log 2 (n+1)"
The depth of a complete binary tree is given by5
प्र: The depth of a complete binary tree is given by
- 1Dn = log 2 (n+1)true
- 2Dn = log 1/2 (n+1)false
- 3Dn = log (n+1)false
- 4Dn = log 2 (n-1)false
- उत्तर देखेंउत्तर छिपाएं
- Workspace
उत्तर : 1. "Dn = log 2 (n+1)"
व्याख्या :
Answer: A) Dn = log 2 (n+1) Explanation: A complete binary tree is a binary tree where all the levels have maximum number of nodes except possibly the last level. The depth of complete binary tree of n nodes will be Dn=log 2 (n+1) where Dn is the height or depth of the tree and n is the number of nodes.