What is a full binary tree?a) Each node has exactly zero or two childrenb) Each node has exactly two childrenc) All the leaves are at the same leveld) Each 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

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

Given the root of a binary tree, return the sum of all left leaves.A leaf is a node with no children. A left leaf is a leaf that is the left child of another node.

Suppose a binary tree is constructed with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be