info@avatto.com
+91-9920808017
0. A binary tree having n nodes and depth d will be about complete binary tree if
any node nd at level less than d-1 has two sons
it contains log(d)+1 nodes
for any node nd in the tree with a right descendent at level d lt must have a left son
all of these
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
