摘要：Check if a given binary tree is completed. A complete binary tree is one in which every level of the binary tree is completely filled except possibly 阅读全文

摘要：Given a matrix of size N x M. For each row the elements are sorted in ascending order, and for each column the elements are also sorted in ascending o 阅读全文

摘要：Get the list of list of keys in a given binary tree layer by layer. Each layer is represented by a list of keys and the keys are traversed from left t 阅读全文

摘要：Find the K smallest numbers in an unsorted integer array A. The returned numbers should be in ascending order. Assumptions A is not null K is >= 0 and 阅读全文