Checking if a Binary Tree is Full: A Hint

[evinda]

Hello! (Smile)

I want to write an algorithm, that checks if a binary tree is full or not.

Could you give me a hint how I could do this? (Thinking)

 

[Ackbach]

Hello! (Smile)

I want to write an algorithm, that checks if a binary tree is full or not.

Could you give me a hint how I could do this? (Thinking)

If every node is either a leaf, or has two children, then it's a full tree. So traverse the tree recursively, and for each node, compute the logical expression (IsLeaf OR HasTwoChildren), then AND all the results together.