Failure node represented by replacing each empty subtree in Extended Binary Tree - Data Structure

Q.  How is the failure node represented by replacing each empty subtree in an Extended Binary Tree ?
- Published on 27 Aug 15

a. *
b. Δ
c. o
d. □

ANSWER: □

Related Content

 

    Discussion

  • Nirja Shah   -Posted on 18 Nov 15
    If each null link (empty subtree) of binary tree is replaced by special node, then resulting tree is called Extended Binary Tree. This special node is represented by the empty square symbol.
    The special nodes added to the tree are called external nodes and the original nodes of the tree are called internal nodes.

➨ Post your comment / Share knowledge


Enter the code shown above:

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