Answer:
TreeNode minimum(TreeNode root) {
if (root != null) {
if (firstChild == null && nextSibling == null) {
return root;
} else {
TreeNode begin = minimum(root.firstChild);
TreeNode last = minimum(root.nextSibling);
if (begin == false && (last == false || begin.data < last.data)) {
return begin;
} else {
return last;
}
} else {
return null;
}
}
Explanation:
The Java program defines a recursive method called minimum that calls itself twice with the first and last leaf of the treenode as the respective arguments. and returns the minimum value of the treenode if the root argument is not undefined.
Answer:
The code is given as below: The input and output is as given for one case.
Explanation:
echo -e "Enter A, B or C : \c" #Printing the line on the screen
read -rN 1 test #read the character in the variable test
echo
case $test in #Setting up the case structure for variable test
[[:lower:]] ) #checking all lower case letters
echo You did not enter A, B or C;;
[D-Z] ) #checking upper case letters from D to Z
echo You did not enter A, B or C;;
A ) #Condition to check A
echo You entered A;;
B ) #Condition to check B
echo You entered B;;
C ) #Condition to check C
echo You entered C;;
esac #Exiting the case structure
Answer:
Following are the solution to this question:
Please find the attachment of this code.
Explanation:
In this code, an email_list method is declared, that accepts a domains parameter, and in the next step, an empty list and two for loop are defined, in which the first for loop is used for a count parameter value and in the second loop is use the append method to add the given value, and use the return method to print its value, and use the print method to call the "email_list" method.