Which traversing method does linear tree use to find the left and right node ? about linear-tree HOT 1 CLOSED

Hi, thanks for your feedback but the plot you reported seems mapped one to one with the summary below.

Starting from the root, the id_node_0 is evaluated and id_node_1 and id_node_2 are created. Then id_node_1 is evaluated and id_node_3 and id_node_4 are created. Then id_node_3 is evaluated but we find no utility in splitting. Then id_node_4 is evaluated and id_node_5 and id_node_6 are created....

What I reported is the order used when evaluating the splits. If u mean that id_node_3 and id_node_4 should be changed in the plot (according to the order they are evaluated during fitting), I can do nothing for this since it's pydot that creates the plot. It displays the circles/squares of each node according to the place at disposal.

If you support the project don't forget to leave a star ;-)

from linear-tree.