Q:

Write a method that checks if a binary tree is strict

belongs to collection: java exercises (medium level )

mahmoud2506
Save to bookmark
|
2022-04-28
|
  168 
0

A binary tree is strict when all nodes have either two or zero child nodes.
Write a method that checks if a binary tree is strict.
TreeNode API methods: node.left() and node.right().

Java programming, exam questions, Java programming exam-questions,
login and add your own answer to this question

All Answers

mahmoud2506
2022-04-28
need an explanation for this answer? contact us directly to get an explanation for this answer 

public Boolean isStrictTree(TreeNode node) {
if (node == null) {
    return true;
}
if ((node.left() == null && node.right() != null) || (node.left() != null && node.right() == null)) {
    return false;
}
return isStrictTree(node.left()) && isStrictTree(node.right());
}

need an explanation for this answer? contact us directly to get an explanation for this answer

total answers (1)

java exercises (medium level )
This question belongs to these collections

Similar questions

need a help?

find thousands of online teachers now
Write a method that checks if there is at least on... >>
<< write a method that returns true if it is possible...