In the field of data structures (and maybe in graph theory), can we use the term topology to speak about the shape of a tree? For instance, consider the two following trees :
1) The first one: Node $a$ is parent of $b$ and $c$. Node $e$ is parent of $a$ and $d$
2) the second one: Node $a$ is parent of nodes $b$, $c$ and $d$.
Can we say that their topology are different, in the sense that the set of relations parents/children are different?