Write a function to find the highest common ancestor (not LCA) of two nodes in a binary tree.

Here ' s a function in Python to find the highest common ancest or ( H CA ) of two nodes in a binary tree : \n ``` python \n def h ca ( node 1 , node 2 ): \n while node 1 != node 2 : \n node 1 = node 1 . parent \n node 2 = node 2 . parent \n return node 1 \n ``` \n This function takes two nodes as input , ` node 1 ` and ` node 2 `, and travers es up the tree until it finds the node that is the grand parent of both ` node 1 ` and ` node 2 `. It then returns this node as the H CA of the two input nodes . \n \n Note that this function finds the H CA of the two input nodes , not the L CA ( le ast common ancest or ). To find the L CA , you would need to modify the function to keep track of the L CA node as it travers es up the tree . </s>