Write a function that counts the number of half nodes (nodes with only one child) in the binary tree without using recursion.

---

Difficulty level

---

This exercise is mostly suitable for LEVEL 3 students

---

int half_nodes(Btree B)
{
    if(!B) return 0;
    if(B->left && !B->right || !B->left && B->right)
        return 1+ half_nodes(B->left) +  half_nodes(B->right) ;
    return half_nodes(B->left) +  half_nodes(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 !!
Delete from a table based on hash coalesced with separated zones

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. !!!