Using your phone's internet browser
go to:  qna.rediff.com
Click and drag this link to
the Home icon in your browser.
Q.

A binary tree in which if all its levels except possibly the last, have the maximum number of
nodes and all the nodes at the last level appear as far left as possible, is known as
(A) full binary tree. (B) AVL tree.
(C) threaded tree. (D) complete binary tree.

Tags: levels, binary tree, maximum number
Asked by rajan, 21 Jun '12 09:19 am
  Invite a friend  |  
  Save  |  
 Earn 10 points for answering
Answer this question  Earn 10 points for answering    
4000 characters remaining  
  
    
Keep me signed inNew User? Sign up

Answers (3)

 
1.

Full binary tree
Answered by uttar, 21 Jun '12 09:21 am

 
  
Report abuse
Useful
 (1)
Not Useful
 (0)
Your vote on this answer has already been received
2.

Full binary tree.
Answered by Manoj M, 22 Jun '12 03:10 pm

 
  
Report abuse
Useful
 (1)
Not Useful
 (0)
Your vote on this answer has already been received
3.

Complete binary tree.
Answered by Mrinalendra Banerjee, 21 Jun '12 09:25 am

 
  
Report abuse
Useful
 (1)
Not Useful
 (0)
Your vote on this answer has already been received

Ask a Question

Get answers from the community

600 characters remaining

Related Answer

Q.
A

Use pdf convertor software, free downloads avl...more

Answered by bharati sharma