摘要：
Given a binary tree, find the leftmost value in the last row of the tree. Example 1: Example 2: 阅读全文
posted @ 2017-08-09 18:33
Pickle
阅读(106)
评论(0)
推荐(0)
摘要：
Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation and r 阅读全文
posted @ 2017-08-09 17:52
Pickle
阅读(97)
评论(0)
推荐(0)
摘要：
Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all 阅读全文
posted @ 2017-08-09 15:59
Pickle
阅读(111)
评论(0)
推荐(0)
摘要：
Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s. A subtree of s is a 阅读全文
posted @ 2017-08-09 14:52
Pickle
阅读(157)
评论(0)
推荐(0)
摘要：
Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longestpath betwee 阅读全文
posted @ 2017-08-09 11:19
Pickle
阅读(123)
评论(0)
推荐(0)
浙公网安备 33010602011771号