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

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!