Could someone please tell me the correct answer for 11, 12, 13, and 14? It\'s C

Question

Could someone please tell me the correct answer for 11, 12, 13, and 14? It's C programming

Inserting nodes in a binary search tree only happens at a leaf node. True False To find the minimum value in a binary search tree, start at the root and go left until there are no more left children (find the leftmost child), then find the rightmost child of the leftmost child. True False In a full binary tree with the root at node 0 and extending to level 4, how many nodes are there? 31 16 64 8 To find the successor of a node. if the node has a right child that has no left children, the right child is the successor. if the node has a right child that has left children, the leftmost child of the right child is the successor. if the node has no right child, the successor is the leftmost child of the node. If the node has no right child, the successor is the parent of the node.

Explanation / Answer

Q11)

   true
Q12)
   Ans: false.

   smallest element is the leftmost child in tree

Q13)
   Ans: Ans: 31,

   Node in full binary tree: 2^h - 1 = 2^5 - 1 = 32

Q14)
   1, 2, and 4 is true statements.

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.