摘要：
Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes. Example: Input: 1 \ 3 / 2 O 阅读全文
摘要：
Design and implement a data structure for a compressed string iterator. It should support the following operations: next and hasNext. The given compre 阅读全文
摘要：
Given a stream of integers and a window size, calculate the moving average of all integers in the sliding window. For example, MovingAverage m = new M 阅读全文
摘要：
Given a nested list of integers, return the sum of all integers in the list weighted by their depth. Each element is either an integer, or a list -- w 阅读全文
摘要：
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 阅读全文
摘要：
Given a binary search tree (BST) with duplicates, find all the mode(s) (the most frequently occurred element) in the given BST. Assume a BST is define 阅读全文
摘要：
You are given a binary tree in which each node contains an integer value. Find the number of paths that sum to a given value. The path does not need t 阅读全文
摘要：
Find the sum of all left leaves in a given binary tree. Example: 3 / \ 9 20 / \ 15 7 There are two left leaves in the binary tree, with values 9 and 1 阅读全文
摘要：
Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: All root-to-leaf paths are: 题目标签：Tree 这道题目给了我们一个二叉树， 阅读全文
摘要：
因为在开始写这个博客之前，已经刷了100题了，所以现在还是有很多题目没有加进来，为了方便查找哪些没加进来，先列一个表可以比较清楚的查看，也方便给大家查找。如果有哪些题目的链接有错误，请大家留言和谅解，链多了会眼花。 # Title Category Difficulty 1528 Shuffle S 阅读全文