摘要：
Given a binary tree, return all root-to-leaf paths. Example Given the following binary tree: 1 / \ 2 3 \ 5 All root-to-leaf paths are: [ "1->2->5", "1 阅读全文
摘要：
Given a binary tree, find the subtree with minimum sum. Return the root of the subtree. Notice LintCode will print the subtree which root is your retu 阅读全文
摘要：
Given a binary tree, find the subtree with maximum average. Return the root of the subtree. Notice LintCode will print the subtree which root is your 阅读全文
摘要：
Given an array with positive and negative numbers, find the maximum average subarray which length should be greater or equal to given length k. Notice 阅读全文