OPTIMAL-BST(p,q, n) let e[1.n + 1,0.n], w[1.n + 1,0..n], root[1..n, 1..n] be new tables for i - 1 to n 1 eli, i-1] = qi-1 Initialize e and w for e1 tonConsider subtrees with at mosti nodes for i=0ton-1+1 set the left and right bounds for r-1 toj root[i,j] - r return e and root OPTIMAL-BST(p,q, n) let e[1.n + 1,0.n], w[1.n + 1,0..n], root[1..n, 1..n] be new tables for i - 1 to n 1 eli, i-1] = qi-1 Initialize e and w for e1 tonConsider subtrees with at mosti nodes for i=0ton-1+1 set the left and right bounds for r-1 toj root[i,j] - r return e and root