1.Given a binary tree and a sum, determine if the tree has a root-to-lea...

Ex.8.14 Prove that the following problem is NP-complete: given an undire...

1.Given a binary tree, find its minimum depth. The minimum depth is the ...

1.Given a binary tree, check whether it is a mirror of itself (ie, symme...

1.Implement int sqrt(int x).Compute and return the square root of x.x is...

1.Given two sorted integer arrays nums1 and nums2, merge nums2 into nums...

1.Return the index of the first occurrence of needle in haystack, or -1 ...

1.Given an array and a value, remove all instances of that value in-plac...

1.Merge two sorted linked lists and return it as a new list. The new lis...