Given two binary trees, write a function to check if they are equal or not.

Two binary trees are considered equal if they are structurally identical and the nodes have the same value.

思路：利用递归。先判断根节点值是否相等，如果相等再分别判断左子树是否相等和右子树是否相等。