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.Group of answer choicesTrueFalse

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

What is a complete binary tree?OptionsA tree In which all nodes have degree 2 A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from right to leftEach node has exactly zero or two childrenA binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right

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

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