Question
What does inTree() return/do for these two methods? class HeapChecker { HeapChecker(){ } boolean addEltTester(IHeap hOrig, int elt, IBinTree hAdded) { if (hOrig.size() + 1
What does inTree() return/do for these two methods?
class HeapChecker {
HeapChecker(){
}
boolean addEltTester(IHeap hOrig, int elt, IBinTree hAdded) {
if (hOrig.size() + 1 == hAdded.size() && hOrig.inTree(elt)+1 == hAdded.inTree(elt)) {
return true;
}
else {
return false;
}
}
boolean remMinEltTester(IHeap hOrig, IBinTree hRemoved) {
if (hOrig.size() == hRemoved.size() +1
&& ( hRemoved.root()>=hOrig.root() || hRemoved.root()
== 0)
&& hRemoved.min() == hRemoved.root()
&& hOrig.inTree(hOrig.root()) == 1 + hRemoved.inTree(hOrig.root())) {
return true;
}
else {
return false;
}
}
}
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started