Q1: Write a function that, given a binary tree of integers, returns the sums of all the root-to-leaf paths.

Input:
	   2
	  /  \
	3     5
  /   \
1      5

Output:
[6, 10, 7]

Q2: https://leetcode.com/problems/kth-largest-element-in-an-array/