What should we call a binary tree whose every node has either zero or two children?
Answers
Answered by
0
According to a source (I cant say because its against brain.lys rules to give a link) A binary tree whose every node has either zero or two children is called extended binary tree. ... Every internal node in the extended binary tree has exactly two children and every external node is a leaf.
Similar questions