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

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

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

A binary tree in which all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is known as:

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

A binary tree should have at least