The depth of a complete binary tree is given by
A) Dn = log 2 (n+1) B) Dn = log 1/2 (n+1)
C) Dn = log (n+1) D) Dn = log 2 (n-1)
The depth of complete binary tree is given by
Answer: A) Dn = log 2 (n+1)
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.
Exam Prep: AIEEE , Bank Exams
Job Role: Analyst , Bank Clerk , Bank PO , Database Administration , IT Trainer , Network Engineer , Project Manager