In a strict binary tree a node can have 0 children.Group of answer choicesTrueFalse

A proper binary tree is a tree in which every node has either 0 or 2 children. Group of answer choicesTrueFalse

In a strict binary tree a node can have 0 children.Correct answer  True You Answered  False

What is the minimum number of children a node can have in a binary tree?Group of answer choices0231

What is a full binary tree?OptionsEach node has exactly zero or two childrenEach node has exactly two childrenAll the leaves are at the same levelEach node has exactly one or two children

How many children can a node have in a binary tree?Group of answer choicesA node can have 1 or 2 childrenA node can have 0 or 2 childrenA node must have 2 childrenA node can have 0, 1 or 2 children