private void removeAVL(TreeNode startingNode, int searchingKey, int hash) {

		currentSearchHeight++;

		if (startingNode == null) {

			HashPrinter.notFound(searchingKey);

			return;

		} else {

			if (startingNode.key > searchingKey) {

				removeAVL(startingNode.left, searchingKey, hash);

			} else if (startingNode.key < searchingKey) {

				removeAVL(startingNode.right, searchingKey, hash);

			} else if (startingNode.key == searchingKey) {

				removeFoundNode(startingNode);

				HashPrinter.remotionSuccessful(searchingKey, searchingKey, startingNode, hash);

			}
		}
	}