Depth-first Search in a Binary Search Tree: In-order

For tutorial: https://dev.to/mattdclarke/implement-depth-first-search-in-a-binary-search-tree-with-javascript-1p96

Transcript

1. 2 3 4 8 5 9 6
2. 2 3 4 8 5 9 6
3. 2 3 4 8 5 9 6
4. 2 3 4 8 5 9 6
5. 2 3 4 8 5 9 6 5
6. 2 3 4 8 5 9 6 5
7. 2 3 4 8 5 9 6 5 3
8. 2 3 4 8 5 9 6 5 3
9. 2 3 4 8 5 9 6 5 3 2
10. 2 3 4 8 5 9 6 5 3 2
11. 2 3 4 8 5 9 6 5 3 2
12. 2 2 3 4 8 5 9 6 5 3 2
13. 2 2 3 4 8 5 9 6 5 3 2
14. 2 2 3 4 8 5 9 6 5 3
15. 2, 3 2 3 4 8 5 9 6 5 3 3
16. 2, 3 2 3 4 8 5 9 6 5 3 4
17. 2, 3 2 3 4 8 5 9 6 5 3 4
18. 2, 3 2 3 4 8 5 9 6 5 3 4
19. 2, 3, 4 2 3 4 8 5 9 6 5 3 4
20. 2, 3, 4 2 3 4 8 5 9 6 5 3 4
21. 2, 3, 4 2 3 4 8 5 9 6 5 3
22. 2, 3, 4 2 3 4 8 5 9 6 5 3 3
23. 2, 3, 4 2 3 4 8 5 9 6 5
24. 2, 3, 4, 5 2 3 4 8 5 9 6 5 5
25. 2, 3, 4, 5 2 3 4 8 5 9 6 5 8
26. 2, 3, 4, 5 2 3 4 8 5 9 6 5 8
27. 2, 3, 4, 5 2 3 4 8 5 9 6 5 8 6
28. 2, 3, 4, 5 2 3 4 8 5 9 6 5 8 6
29. 2, 3, 4, 5 2 3 4 8 5 9 6 5 8 6
30. 2, 3, 4, 5, 6 2 3 4 8 5 9 6 5 8 6
31. 2 3 4 8 5 9 6 5 8 6 2, 3, 4, 5, 6
32. 2 3 4 8 5 9 6 5 8 2, 3, 4, 5, 6
33. 2 3 4 8 5 9 6 5 8 8 2, 3, 4, 5, 6, 8
34. 2 3 4 8 5 9 6 5 8 2, 3, 4, 5, 6, 8 9
35. 2 3 4 8 5 9 6 5 8 2, 3, 4, 5, 6, 8 9
36. 2 3 4 8 5 9 6 5 8 2, 3, 4, 5, 6, 8 9
37. 2 3 4 8 5 9 6 5 8 2, 3, 4, 5, 6, 8, 9 9
38. 2 3 4 8 5 9 6 5 8 9 2, 3, 4, 5, 6, 8, 9
39. 2 3 4 8 5 9 6 5 8 2, 3, 4, 5, 6, 8, 9
40. 2 3 4 8 5 9 6 5 8 8 2, 3, 4, 5, 6, 8, 9
41. 2 3 4 8 5 9 6 5 2, 3, 4, 5, 6, 8, 9
42. 2 3 4 8 5 9 6 5 5 2, 3, 4, 5, 6, 8, 9
43. 2 3 4 8 5 9 6 2, 3, 4, 5, 6, 8, 9
44. 2 3 4 8 5 9 6 2, 3, 4, 5, 6, 8, 9
45. 2 3 4 8 5 9 6