Write a recursive function to calculate the height of a binary tree. Note: A node in a binary tree has two pointers, named 'left' and 'right', respectively, where the 'left' pointer is used to find the left child of the node and the 'right' pointer is used to find the right child. Your function will take a node as the input and return an integer.