Full binary tree complete binary tree strict binary tree example
Answers
Answer: Full binary tree == Strict binary tree =>
A) 19
/ \
16 21
/ \
41 51
/ \
32 51
b) 18
/ \
40 30
/ \
100 40
c) 25
/ \
14 35
/ \ /
12 15 32
Complete binary tree -> A, C are complete binary tree but b is not.
Explanation:
=> Full binary tree == Strict binary tree => If every non-leaf node in a binary tree has nonempty left and right subtrees, the tree is termed a strictly binary tree. Or, to put it another way, all of the nodes in a strictly binary tree are of degree zero or two, never degree one. A strictly binary tree with N leaves always contains 2N – 1 nodes.
==> Complete binary tree -> A Binary Tree is complete Binary Tree if all levels are completely filled except possibly the last level and the last level has all keys as left as possible