2017年7月2日
LeetCode 104. Maximum Depth of Binary Tree （二叉树的最大深度）
摘要： 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 l 阅读全文
posted @ 2017-07-02 06:32 Jimmy_Cheng 阅读(307) 评论(0) 推荐(0)
LeetCode 101. Symmetric Tree （对称树）
摘要： Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmet 阅读全文
posted @ 2017-07-02 00:43 Jimmy_Cheng 阅读(1407) 评论(0) 推荐(0)