Leetcode
Showing posts with label
tree
.
Show all posts
Showing posts with label
tree
.
Show all posts
Sunday, August 2, 2015
GeeksforGeeks: Diameter of a Binary Tree， Inorder Successor in Binary Search Tree
›
Diameter of a Binary Tree http://www.geeksforgeeks.org/diameter-of-a-binary-tree/ 在返回想要的值的同时，传入pointer计算树的高度 int helper(TreeNode *root, ...
Tuesday, July 14, 2015
Day 117, #235, #236, Lowest Common Ancestor of a Binary Search Tree, Lowest Common Ancestor of a Binary Tree
›
Lowest Common Ancestor of a Binary Search Tree Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes ...
Friday, June 26, 2015
Google interview questions #1
›
找出二叉查找树中出现频率最高的元素。树中结点满足left->val <= root->val <= right->val。如果多个元素出现次数相等，返回最小的元素。 http://blog.csdn.net/luckyxiaoqiang/articl...
›
Home
View web version