2016年5月10日
LeetCode OJ 236. Lowest Common Ancestor of a Binary Tree
摘要： 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 lowes 阅读全文
posted @ 2016-05-10 17:56 Black_Knight 阅读(193) 评论(0) 推荐(0) 编辑
LeetCode OJ 235. Lowest Common Ancestor of a Binary Search Tree
摘要： Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST. According to the definition of LCA on Wikipedia 阅读全文
posted @ 2016-05-10 10:37 Black_Knight 阅读(166) 评论(0) 推荐(0) 编辑
LeetCode OJ 257. Binary Tree Paths
摘要： Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: 1 / \ 2 3 \ 5 All root-to-leaf paths are: ["1->2->5" 阅读全文
posted @ 2016-05-10 10:29 Black_Knight 阅读(184) 评论(0) 推荐(0) 编辑