private void removeAVL(TreeNode startingNode, int searchingKey, int hash) {
		currentSearchHeight++;
		if (startingNode == null) {
			System.out.println("\nKey " + searchingKey + " not found.");
			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);
				System.out.println("\nKey " + searchingKey + " with Value " + startingNode.value
						+ " removed successfully in position " + hash + " at tree height " + currentSearchHeight + ".");
			}
		}
	}