摘要：
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./** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * ... 阅读全文
摘要：
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.这道题非常直接，只需要递归深搜就可以。需要注意的是递归的终止条件：root为空，深度为0；root没有孩子，深度为1。如果存在孩子，则递归深搜下去。/** * Definition for binary tree * struct TreeNode { * int val; ... 阅读全文