Recursionmedium
0:00.0
A full binary game tree of depth is constructed such that each leaf node has a value of 1, and each internal node has a value equal to the sum of the values of its two children plus 1. If is the value of the root of a tree of depth (where a tree of depth 0 has just 1 leaf node), which recurrence relation holds?
A full binary game tree of depth is constructed such that each leaf node has a value of 1, and each internal node has a value equal to the sum of the values of its two children plus 1. If is the value of the root of a tree of depth (where a tree of depth 0 has just 1 leaf node), which recurrence relation holds?