A binary tree whose every node has either zero or two children is called

Options
- Complete binary tree
- Binary search tree
- Extended binary tree
- None of the above

CORRECT ANSWER : Extended binary tree

Discussion Board
Wrong Information

Useless article and misleading information

Mohit Gupta 07-19-2019 07:23 AM

Data Structure - Extended Binary Tree

A binary tree whose every node has either zero or two children is called extended binary tree. Extended binary tree consists of replacing every null subtree of the original tree with special nodes. Empty circle represents internal node and filled circle represents external node.
The nodes from the original tree are internal nodes and the special nodes are external nodes. Every internal node in the extended binary tree has exactly two children and every external node is a leaf. It displays the result which is a complete binary tree.

Prajakta Pandit 02-1-2017 04:21 AM

Write your comments


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)


Related Content

Advertisement
 
▲