full binary tree , complete and almost complete binary tree difference

Question

what is the difference between all these types of trees

1)full binary tree 2) complete binary tree 3) almost complete binary tree 4)perfect binary tree 5)strictly binary tree

is every full binary tree is of all types of binary trees

Answer 1

(1) Full/Perfect binary tree: All leaves are same level and all non-leaf nodes have two child nodes.

(2) Complete binary tree: All leaves are at same level.

(3) Strictly binary tree: Every non leaf nodes must have two child nodes.

Comments

there is some different definition given in coreman of full binary tree 

and what is almost complete binary tree ?

---

The answer is plain wrong and incomplete. Full Binary Tree is NOT same as Perfect Binary Tree. 

Answer 2

I find the following link helpful

Difference between “Complete binary tree”, “strict binary tree”,“full binary Tree”-  https://stackoverflow.com/questions/12359660/difference-between-complete-binary-tree-strict-binary-tree-full-binary-tre/32064101#32064101

Difference between complete and almost complete binary tree- https://stackoverflow.com/questions/26327125/difference-between-complete-and-almost-complete-binary-tree