If a binary tree contains either two or zero children, then it is called as
Reveal answer
Fill a bubble to check yourself
Keep practicing — related questions
- A binary tree whose every node has either zero or two children is called
- A 2 - 3 tree is a type of
- Which of the following statements is/are true?
- In Strictly binary tree, out degree of each node will be....
- Which of the following forms of binary tree is the one in which every non-leaf node has non-empty left and ...
- How many children are there in a binary tree?
- In which of the following binary trees is every level, except possibly the last, completely filled?
- A complete binary tree with the property that the value at each node is at least as large as the values at ...