Q. A binary tree whose every node has either zero or two children is called (Solved)
1. Complete binary tree
2. Binary search tree
3. Extended binary tree
4. None of above
- c. Extended binary tree
1. Complete binary tree
2. Binary search tree
3. Extended binary tree
4. None of above