is it possible to do this problem using the Euler tree traversal method? if so, how?

For example to find GCD(50, 10) we do the following

50/2 = 25, 50/3 = 16.33, 50/4 = 12.5, 50/5 = 10, 50/6 = 8.67, 50/7 = 7.14, 50/8 = 6.25, 50/9 = 5.26, 50/10 = 5, 50/11 = 4.55, 50/12 = 4.17, 50/13 = 3.85, 50/14 = 3.57, 50/15 = 3.33, 50/16 = 3.13, 50/17 = 2.94, 50/18 = 2.78, 50/19 = 2.63, and 50/20 = 2.5.

20/2 = 10, 20/3 = 6.67, 20/4 = 5, 20/5 = 4, 20/6 = 3.33, 20/7 = 2.86, 20/8 = 2.5, 20/9 = 2.22, and 20/10 = 2

The results show 2, 5, and 10 as divisors for the 50 and 2, 4, 5, and 10 for 20.