Answer:
False ( A )
Explanation:
The implementation is incorrect hence the return would be false and this is because : root.left is supposed to be NULL, root.right is supposed to be NULL and when these conditions are met then the Binary tree would be empty.
The condition for the above statement would be represented as
if( root.left = = null && root.right == null &&root.info == null)
return true;
else
return false;
Hello! I believe the answer for this is "True"!
Answer:
Recursive solutions can be less efficient than their iterative counterparts
Explanation:
Recursion can be defined or described as a method of solving a problem where the solution depends on solutions to smaller instances of the same problem.
It entails using iteration to ensure that smaller parts of a solution are satisfied towards solving thw overall problem.
Ita major disadvantage seems to be that it seem to be less efficient than their iterative counterparts. This is as a result of concentrating on trying to solve a smaller instances.
