Self Doubt

Question

Are Full and Perfect binary tree same ?

Comments

Normally, Full binary tree means every level node has either 0 or 2 childrens, but perfect binary tree means every level( except last level, i.e., in which level leaves exist ) node should have 2 childrens.

In the GATE Exam, I hope they define these terms

---

If an internal node has 0 children then will it be internal ?

---

sorry vishalshrm539, it's my mistake, wrongly used the terms, i will update it

---

Shaik Masthan I think you have said the opposite thing..

In full binary tree all nodes have 2 children except the leaves..The diagram labeled as perfect should be full..

The diagram labeled as full should be complete binary tree...

Perfect binary tree I didn't hear of it earlier..but searched now and it is defined same as full..I couldn't find any difference :/

perfect binary tree

(definition)

Definition: A binary tree with all leaf nodes at the same depth. All internal nodes have degree 2.

Ref: https://xlinux.nist.gov/dads//HTML/perfectBinaryTree.html

---

@MiNiPanda read this

https://www.geeksforgeeks.org/binary-tree-set-3-types-of-binary-tree/

---

Sorry Shaik Masthan Yes you are right.. i got confused :P

---

@MiNiPanda

No problem BRO