public treeNode getNextRightSibling(treeNode curNode) {
		treeNode parent = curNode.parent;

		if (parent == null) // curNode is root , no right sibling
			return null;

		if (parent.leftLeaf == curNode)
			return parent.rightLeaf;

		treeNode parentRightSibling = getNextRightSibling(parent);
		if (parentRightSibling != null && parentRightSibling.leftLeaf != null) {
			return parentRightSibling.leftLeaf;
		}

		return null;
	}