Please, try EDU on Codeforces! New educational section with videos, subtitles, texts, and problems. ×

TheAngel's blog

By TheAngel, history, 11 months ago, In English,

Hello I managed to understand the problem and what it needs but my idea is to use Catalan numbers to count number of binary trees but in problem it wants to count the number of BS trees of length n with height at least h and root and leafs included but I could not discard or exclude all count of trees of height less than h from Catalan numbers

Any hint please I will be thankful and grateful and thanks in advance

Read more »

  • Vote: I like it
  • -2
  • Vote: I do not like it