[Updated] Goldman Sachs Aptitude Test Questions and Answers
Practice List of TCS Digital Coding Questions !!!
Take 50+ FREE!! Online Data Interpretation Mock test to crack any Exams.

Data Structures :: Trees - Discussion

Home > Data Structures > Trees > MCQs Questions Discussion

6 / 194

Choose the correct option.

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

Afull binary tree.

BAVL tree.

Cthreaded tree.

Dcomplete binary tree.

Answer: Option (Login/Signup)

Show Explanation

Option D should be correct as the given statement matches the definition"A complete binary tree is a binary tree in which all the levels are completely filled except possibly the lowest one, which is filled from the left. A complete binary tree is just like a full binary tree, but with two major differences. All the leaf elements must lean towards the left."

Asked In :: SAP Labs

Post Your Answer Here:     

Reply    
Rate This: +0 -0
    Report


Report Error

Please Login First Click Here