I could maybe simplify that a bit

why was the transfer rejected?

Rejecting as deprecated by the child fork. Please remember that pending forks can be edited and do not have to be forked.

Critical issues are assertions with strict equality and incorrect failure messages. This translation must not be approved, please edit this fork to fix the issues (I will reject it in a couple of hours if not fixed).

Modelling this task with a class does not make much sense. Solution should be a free function.

Referactored the code to make a simplier and more concise solution that only shows to the end user the method instead of the whole class body. The class body is preloaded instead.

Here is a C++ tanslation of this kata.

One of the hardest kata I had faced, really entertaining and helpful, I had to explore tens of different approaches to finally have the solution. I really reccommend it.

This code wasn't meant to be published, I was testing performances between two algorithms...
Do not pay attention to the comments

Ok, everything is fine, I was wrong... I only realized now that you need to move using BFS in the tree.

Hi ! I am currently working on this very good exerccice. It is very engaging. But, I am struggling with the given example of a tree of height 3 where we search for the 3th node in pre order (3, 3). I do not find that the 3th node visited is 5 but 4 (even when doing the traversal by myself). So I wanted to know if I was wrong or if there was a problem in the example.