Is the drawn T' the doubled version of T? If not, what is the doubled version? And how do I run
Hierholzer's algorithm on this?(See part (a))
Figure 2: Rooted binary tree In the rooted binary tree in Figure 2, we'll choose alphabetically when
unsure. Then a breadth-first search would traverse in this order r,a,b,c,d,e,f while a depth-first
search would traverse in this order r,a,c,d,b,e,f (a) Suppose T is the rooted binary tree in Figure 2.
Let T is its doubled version. Run Hierholzer's algorithm (alphabetic order when undecided). (b)
Which search was this?.
Is the drawn T the doubled version of T If not what is th.pdf
1. Is the drawn T' the doubled version of T? If not, what is the doubled version? And how do I run
Hierholzer's algorithm on this?(See part (a))
Figure 2: Rooted binary tree In the rooted binary tree in Figure 2, we'll choose alphabetically when
unsure. Then a breadth-first search would traverse in this order r,a,b,c,d,e,f while a depth-first
search would traverse in this order r,a,c,d,b,e,f (a) Suppose T is the rooted binary tree in Figure 2.
Let T is its doubled version. Run Hierholzer's algorithm (alphabetic order when undecided). (b)
Which search was this?
