Binary search tree height

As part of HackerRank 30 Days of Code Challenge, I solved the binsary search tree height problem (day 22). My solution is not the most efficient/prettiest solution but it is mine (!):

	//Day 22 of HackerRank 30 Days of Code challenge: Find height of binary search tree
	class BSTHeight {
	static int height = -1;
	static int maxHeight = -1;
	public static int getHeight(Node root){
	findMaxHeight(root);
	return maxHeight;
	}
	private static void findMaxHeight(Node node) {
	height++; //go down the tree
	//System.out.println("data: " + node.data + ", height: " + height);
	if(height > maxHeight) {
	maxHeight = height;
	//System.out.println("maxHeight: " + maxHeight);
	}
	if(node.left != null) {
	getHeight(node.left);
	}
	if(node.right != null) {
	getHeight(node.right);
	}
	height--; //go up the tree
	}
	}

view raw BSTHeight.java hosted with ❤ by GitHub