[Solved]-Question 12 10 Marks Recall Binary Tree Node Children Called Leaf Given Following Node Dec Q37189296

Question 12 [10 Marks] Recall that, in a binary tree, a nodethat has no children is called a leaf. Given the following nodedeclaration: struct treeNode mt value; struct treeNode *left;struct treeNode *right; }; write function called t re e Le a f C oun t () that takes one struct treeNode *root parameter and returnsthe number of leaves in the tree pointed to by root. You may notuse global variables in your solution. Answer.

Question 12 [10 Marks] Recall that, in a binary tree, a node that has no children is called a leaf. Given the following node declaration: struct treeNode int value; struct treeNode .left; struct treeNode «right; li write a function called treeLeafCount () that takes one struct treeNode root parameter and returns the number of leaves in the tree pointed to by root. You may not use global variables in your solution. Answer Show transcribed image text Question 12 [10 Marks] Recall that, in a binary tree, a node that has no children is called a leaf. Given the following node declaration: struct treeNode int value; struct treeNode .left; struct treeNode «right; li write a function called treeLeafCount () that takes one struct treeNode root parameter and returns the number of leaves in the tree pointed to by root. You may not use global variables in your solution. Answer

Expert Answer

---

Answer to Question 12 [10 Marks] Recall that, in a binary tree, a node that has no children is called a leaf. Given the following … . . .