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

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

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

A binary search tree is a binary tree where:Group of answer choicesIt is always a complete binary tree.Both b and d.The data in the tree is stored in a specific order.The left subtree contains values less than the root, and the right subtree contains values greater than the root.

A binary tree should have at least