Script Java

12.1 Binärer Baum
}
else return "female";
public String getFathersName() {return getFather().getName();}
public String getMothersName() {return getMother().getName();}
public String toString() {return name+" ("+father+", "+mother+")";}
public int count() {return 1+father.count()+mother.count();}
public int maxDepth() {
return 1+Math.max(father.maxDepth(), mother.maxDepth());
}
public boolean treeContains(Person person) {
if (this==person) return true;
else
return father.treeContains(person)||mother.treeContains(person);
}
public boolean isRelatedTo(Person person) {
if (person.treeContains(this)) return true;
else
return father.isRelatedTo(person)||mother.isRelatedTo(person);
}
public void paint(Graphics g, int x, int y, int dist) {
g.fillOval(x-3,y-3,6,6);
g.drawString(name,x+6,y+3);
if((!father.isEmpty())&(y>60)) {
g.drawLine(x,y,x-dist,y-50);
father.paint(g,x-dist,y-50,dist/2);
}
if((!mother.isEmpty())&(y>60)) {
g.drawLine(x,y,x+dist,y-50);
mother.paint(g,x+dist,y-50,dist/2);
}
}
}
public String toPostOrder() {
return father.toPostOrder()+mother.toPostOrder()+
getName()+"\n"+getSex()+"\n"+getFathersName()+
"\n"+getMothersName()+"\n";
}
public class EmptyPerson extends Person{
public EmptyPerson() {super("");}
public boolean isEmpty() {return true;}
public String getName() {return "";}
public Person getFather() {return empty;}
public Person getMother() {return empty;}
public String toString() {return "";}
public int count() {return 0;}
public int maxDepth() {return 0;}
public boolean treeContains(Person person) {return false;}
public boolean isRelatedTo(Person person) {return false;}
public void paint(Graphics g, int x, int y, int dist) {return;}
public String toPostOrder() {return "";}
}
247