Catalan numbers, bst

Правка en1, от Bobek, 2017-09-03 01:52:27

I know that a number of valid parantheses is nth catalan number. The same is for number of binary search trees. Is there any way to convert valid parantheses sequence to binary search tree with keys 1-n?

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Bobek 2017-09-03 01:52:27 230 Initial revision (published)