Professional Documents
Culture Documents
Student Details
Name ID
[For Teachers use only: Don’t Write Anything inside this box]
Report Status
Marks: ………………………….. Signature:.....................
Comments:....................................... Date:..............................
TITTLE OF THE PROJECT PROPOSAL
Research Project on Obscure binary search trees
Conclusion:
Any binary tree is said to be perfect when all the interior nodes
have exactly two children, and at the same time, every leaf node
has the same depth. We can understand this better with an
example of an ancestry chart. Here, each person will have exactly
two biological parents. The only condition here is that the mother
and father should be placed on the same side every time so that
their gender can be used as an analogy for the left and right nodes.
With this, we can say that a perfect tree is always a complete tree,
but every complete tree is not necessarily a perfect one.