演算法›Ch3 動態規劃
第 38 題/共 40 題
◀ AL 38/40
38. Binary Tree、Catalan Number、Dynamic Programming
#AL-03-038易Binary TreeCatalan NumberDynamic Programming

Consider structurally unique binary trees with n nodes. For example, when n=3, there are 5 structurally unique binary trees.

Which of the following statements is (are) true?

📄 中央115
跳轉到第題
▤完整推導請見《WH 資工筆記 · 演算法》Ch3 動態規劃
本章題號 · 21–40 / 40