C++遞迴DP解答Leetcode 894二元樹問題All Possible Full Binary Trees

C++遞迴DP解答Leetcode 894二元樹問題

所有可能的full二元樹。使用 TreeNode* 的二維陣列作為記憶。 用 memo 遞迴解答。再次用 DP 解答完成。

All Possible Full Binary Trees Use 2D array for TreeNode* as memoization. Solve it recursely with memo. Again a DP solution is done. 

[LeetCode程式]https://www.youtube.com/watch?v=7g-E3d_Oja4&list=PLYRlUBnWnd5IdDHk2BjqXwesydU17z_xk&index=1

不用懷疑，寫這種tree問題有時是需要證明的！！

圖畫出來

n=1
└── 0

================
n=2

================
n=3
│   ┌── 0
└── 0
    └── 0

================
n=4

================
n=5
│       ┌── 0
│   ┌── 0
│   │   └── 0
└── 0
    └── 0
│   ┌── 0
└── 0
    │   ┌── 0
    └── 0
        └── 0

================