A binary tree node has data , pointer to left child and a pointer to right child
struct Node { int data ; struct Node * left ; struct Node * right ; } ; int heightOfTreeUtil ( Node * root , bool isEven ) {