FB面经 Prepare: K closest point to the origin
Based on bucket sort: Based on Quick Select 当然，还有的方法是维护一个size为k的最大堆 ...
原文：FB面经 Prepare: LCA of Deepest Nodes in Binary Tree
Recursion: 返回的时候返回lca和depth，每个node如果有大于一个子节点的depth相同就返回这个node，如果有一个子节点depth更深就返回个子节点lca，这个o n 就可以了 Iteration:tree的recursion换成iteration处理，一般用stack都能解决吧 相当于手动用stack模拟recursion 。感觉这题可以是一个样的做法，换成post ord ...
2017-03-15 00:38 0 1300 推荐指数：
相关推荐
1151 LCA in a Binary Tree（30 分）
The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descendants. Given any two nodes ...
Lowest Common Ancestor of Two Nodes in a Binary Tree
/lowest-common-ancestor-of-a-binary-tree-part-ii.html (1) Is the tree a BST or not? BST的话，我们就能按照BS ...
LCA Binary Lifting 倍增
留坑 待填 一篇不错的CF博客 这篇纯讲理论的，比较清楚。 去CF上搜Gym algorithm 可以看到很多算法文章。 ...
[LeetCode] 863. All Nodes Distance K in Binary Tree 二叉树距离为K的所有结点
We are given a binary tree (with root node `root`), a `target` node, and an integer value `K`. Return a list of the values of all nodes that have ...
Binary Tree和Binary Search Tree
Binary TreeDefinition： at most two children node. Binary Tree Example: 10 ==root / \ 13 ...
[LeetCode] Count Complete Tree Nodes
Count Complete Tree Nodes Given a complete binary tree, count the number of nodes. In a complete binary tree every level, except possibly the last ...
[Leetcode] Balanced Binary Tree
问题：给一个二叉树，写一个算法判断这个树是不是balanced。 Solution #1. 第一次遇到这个问题时我的解法，如下： 写了一个getDepth()函数，访问每个节点都要 ...