Discussion
A binary tree whose every node has either zero or two children is called :
Answer: B
Such a tree is called an extended binary tree.
An extended binary tree, also called a 2-tree, is one in which every node has either 0 or 2 children. The nodes with two children are internal nodes and those with none are external nodes. It is also known as a full binary tree.
A binary search tree is defined by key order, a complete binary tree by levels being filled left to right, and a skewed tree by every node having only one child.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development