Welche Programmiersprache für Informatik-Studium?

#ifndef TREE_H_
#define TREE_H_

#include "node.h"
#include <iostream>

using namespace std;

template <class type>
class Tree {
	node<type>* root;
	
	void print(ostream& str, node<type>* current) {
		if(current != NULL) {
			print(str, current->getLeft());
			str << current->getValue() << " ";
			print(str, current->getRight());
		}
	}
	
	void removeAllNodes(node<type>* current) {
		if(current != NULL) {
			removeAllNodes(current->getLeft());
			removeAllNodes(current->getRight());
			delete current;
		}
	}
	
public:
	Tree(type nValue) {
		root = new node<type>(nValue);
	}
	
	void addNode(type nValue) {
		node<type>* current = root;
		
		/*// Methode 1
		while(current != NULL) {
			if(current->getRight() == NULL && nValue > current->getValue()) {
					current->setRight(new node<type>(nValue));
					break;
			}else if(nValue > current->getValue()){
				current = current->getRight();
			}
			
			if(current->getLeft() == NULL && nValue < current->getValue()) {
					current->setLeft(new node<type>(nValue));
					break;
			}else if(nValue < current->getValue()){
					current = current->getLeft();
			}
		}*/
		
		// Methode 2
		node<type>* prevNode = NULL;
		while(current != NULL) {
			prevNode = current;
			current = nValue > current->getValue() ? current->getRight() : current->getLeft();
		}
		
		if(nValue > prevNode->getValue()){
			prevNode->setRight(new node<type>(nValue));
		} else if(nValue < prevNode->getValue()) {
			prevNode->setLeft(new node<type>(nValue));
		}
		
	}
	
	bool find(type nValue) {
		node<type>* current = root;
		while(current != NULL) {
			if(nValue > current->getValue()){
				current = current->getRight();
			} else if(nValue < current->getValue()) {
				current = current->getLeft();
			} else if(nValue == current->getValue()) {
				return true;
			}
		}
		
		return false;
	}
	
	~Tree() {
		removeAllNodes(root);
	}
	
	void printTree() {
		print(cout, root);
		cout << endl;
	}
};

#endif /*TREE_H_*/