Question: A binary tree whose every node has either zero or two children is called........... 1-complete binary tree 2-binary search tree 3-extended binary tree 4-data structure
A binary tree whose every node has either zero or two children is called...........
1-complete binary tree
2-binary search tree
3-extended binary tree
4-data structure
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
