2015年8月17日
LeetCode:Lowest Common Ancestor of a Binary Tree(update)
摘要： Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to the definition of LCA on Wikipedia: “The lowest... 阅读全文
posted @ 2015-08-17 15:03 尾巴草 阅读(129) 评论(0) 推荐(0)
LeetCode:Add Digits
摘要： Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3... 阅读全文
posted @ 2015-08-17 11:29 尾巴草 阅读(107) 评论(0) 推荐(0)
LeetCode: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 le... 阅读全文
posted @ 2015-08-17 10:49 尾巴草 阅读(119) 评论(0) 推荐(0)
LeetCode:Minumum Depth of Binary Tree
摘要： Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest le... 阅读全文
posted @ 2015-08-17 10:43 尾巴草 阅读(138) 评论(0) 推荐(0)
LeetCode:Same Tree
摘要： 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 an... 阅读全文
posted @ 2015-08-17 09:43 尾巴草 阅读(116) 评论(0) 推荐(0)