Write a recursive function that counts the number of nodes in a binary tree of integers.

---

Difficulty level

---

This exercise is mostly suitable for LEVEL 3 students

---

int nb_node_rec(Btree B)
{
	if (B == NULL)
		return 0;
	return 1 + nb_node_rec(B->left) + nb_node_rec(B->right);
}

---

Click here for more Recursive function exercises! Click here for more Recursion exercises! Click here for more Binary trees exercises! Back to the list of exercises

---

Looking for a more challenging exercise, try this one !!
Removing a sequence of 3 characters from a string

Mistakes may occur. If, while solving, you come across any mistakes with the codes, please, don't hesitate to contact me so that we may correct it together, creating a better programming community.
All proposed suggestions are most welcomed. !!!