max sum of rectangle no larger than k: basically brute force version of 1D max sum of sub array no larger than k. Do a binary search to find any value > sum - k among previous sums. Binary search tree count complete tree nodes kth smallest element in a BST: in order traversal BFS ...