Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // klausuraufgabe 1: anzahl der knoten die höher als 10 waren zurückgeben
- public int count10(){
- return count10(top);
- }
- private int count10(BinaryTreeNode node){
- if (node==null) return 0;
- else{
- if (node.getNumber()>10){
- if (node.getSmaller()==null){
- return 1 + count10(node.getLarger());
- }
- else if (node.getLarger()==null){
- return 1 + count10(node.getSmaller());
- }
- else if (node.getSmaller()==null && node.getLarger()==null){
- return 1 + count10(node.getSmaller()) + count10(node.getLarger());
- }
- }
- }
- return count10(node.getSmaller()) + count10(node.getLarger());
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement