递归
Juxin_Lin
这个作者很懒,什么都没留下…
展开
-
【LeetCode】104. Maximum Depth of Binary Tree
Difficulty: EasyGiven 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./** * Defin原创 2017-01-07 19:12:17 · 184 阅读 · 0 评论 -
【LeetCode】100. Same Tree
Difficulty: EasyGiven 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 sam原创 2017-01-07 18:53:35 · 202 阅读 · 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 symmetric: 1 / \ 2 2 / \ / \3 4 4 3原创 2017-01-08 17:00:02 · 320 阅读 · 0 评论