Questions

$(1)$

Design an algorithm that will decide whether two polynomials of ${\mbox{${\mathbb{Z}}$}}[x]$ , represented using expression trees, are equal.

$(2)$

Give an asymptotic upper bound for your algorithm.