Answers for "no of possible minheaps"

0

no of possible minheaps

T(N) =(N-1)Ck * T(k) * T(N-k-1), where k = number of nodes on left subtree

T(1) = 1
T(2) = 1
T(3) = 2
T(4) = 3C2 * T(2) * T(1) = 3
T(5) = 4C3 * T(3) * T(1) = 8
T(6) = 5C3 * T(3) * T(2) = 20
T(7) = 5C3 * T(3) * T(3) = 80
Posted by: Guest on October-18-2020

Code answers related to "no of possible minheaps"

Browse Popular Code Answers by Language