Data types can be kept as part of the syntax tree of a program and checked for structural equivalence by a single recursive algorithm. For example, the type

$```$

struct $\{$

double x;

int y$[10]$;

$\}$

$```$

might be kept as the tree shown in Figure $8\mathrm{.}21.$

Figure $8\mathrm{.}21$ A Syntax Tree for the Struct Definition

Describe a tree node structure that could be used to express the types of $\backslash ($ C $\backslash )$ or a similar language as trees. Write out a TypeEqual function in pseudocode that would check the structural equivalence of these trees.