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()函數，訪問每個節點都要 ...