GBDT Compared with the random forest algorithm, which of the following statements is wrong?
A . GBDT Algorithm is easier to underfit than random forest
B . Random forest is calculated in parallel, while GBDT Can’t
C . GBDT Algorithm is easier to overfit than random forest
D . GBDT And random forest are built on CART Based on the tree
Answer: C