Our algorithm also fills a table for problem solving, but the table's size is |Z| × (L + 1).
the size of the table equals the number of nodes of the ZDD Algorithm 1 Dynamic Programming Algorithm Input: ZDD Z that represent T , length limit L, and wi, li for else 16: i ← lo(i) 17: return r that represents a set of subtrees T .