Problem
Provide an algorithm for constructing a tree-CPD that is the reduced tree reduced for a given context c. In other words, assume you are given a tree-CPD for P(X | PaX) and a context c such that Scope[c] ⊂ PaX. Provide a linear time algorithm for constructing a tree that represents P(X|PaX, c).