2016年3月13日
Binary Tree Level Order Traversal
摘要： Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example: Given binary tree { 阅读全文
posted @ 2016-03-13 22:35 YuriFLAG 阅读(120) 评论(0) 推荐(0)
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-03-13 08:30 YuriFLAG 阅读(147) 评论(0) 推荐(0)
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-03-13 07:52 YuriFLAG 阅读(155) 评论(0) 推荐(0)