[algogeeks] cormen problem

referring to problem 12-4 of CLR how does we show that b0 ( the number of binary trees formed by 0 nodes is 1) --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send ema

[algogeeks] Cormen Problem

Given two sorted arrays of length n, we need an O(lg(n)) algo that finds the median of the array of resulting from the combination of these two arrays. Thanks Rohit