Multiple choice Which of the following statements is/are true? A perfect binary tree has 2^{(n+1)-1 nodes, where n is the depth of the tree. A perfect binary tree has 2^n leaf node, where n is the depth of the tree. A full binary tree has each node either a leaf node or internal node with exactly two non-empty children. Only (1) and (2) are true. (1) , (2) and (3) all are true. Reveal answer Fill a bubble to check yourself E Correct answer Explanation Yes, this is the correct choice.