Algorithm 2 Serial implementation of Random Forest

Input: $\mathit{i}\mathit{n}\mathit{p}\mathit{u}\mathit{t}\_\mathit{d}\mathit{a}\mathit{t}\mathit{a}$ → Features, thresholds, left and right             children’s nodes 1: Step 1: Development of the $\mathit{t}\mathit{r}\mathit{e}\mathit{e}\_\mathit{s}\mathit{t}\mathit{r}\mathit{u}\mathit{c}\mathit{t}\mathit{u}\mathit{r}\mathit{e} function$ 2: The single tree outputs $\mathit{p}\mathit{r}\mathit{o}\mathit{b}\_\mathit{a}\mathit{r}\mathit{r}\mathit{a}\mathit{y}$ 3: Step 2: Building of the forest 4: $\mathbf{f}\mathbf{o}\mathbf{r} i=0 to {\mathit{n}}_{\mathit{t}\mathit{r}\mathit{e}\mathit{e}\mathit{s}}-1$ 5:  $\mathit{t}\mathit{r}\mathit{e}\mathit{e}\_\mathit{s}\mathit{t}\mathit{r}\mathit{u}\mathit{c}\mathit{t}\mathit{u}\mathit{r}\mathit{e}(\mathit{i}\mathit{n}\mathit{p}\mathit{u}\mathit{t}\_\mathit{d}\mathit{a}\mathit{t}\mathit{a},\mathit{p}\mathit{r}\mathit{o}\mathit{b}\_\mathit{a}\mathit{r}\mathit{r}\mathit{a}\mathit{y},i);$ 6:   $\mathrm{F}\mathrm{i}\mathrm{n}\mathrm{d} \mathit{m}\mathit{a}\mathit{x}, \mathrm{i}\mathrm{n}\mathrm{d}\mathrm{e}\mathrm{x} \mathrm{o}\mathrm{f} \mathit{p}\mathit{r}\mathit{o}\mathit{b}\_\mathit{a}\mathit{r}\mathit{r}\mathit{a}\mathit{y} maximum$ 7:   ${\mathit{c}\mathit{l}\mathit{a}\mathit{s}\mathit{s}}_{\mathit{m}\mathit{a}\mathit{x}}++;$ 8: $\mathbf{e}\mathbf{n}\mathbf{d}$ 9: $\mathrm{F}\mathrm{i}\mathrm{n}\mathrm{d} \mathit{i}\mathit{m}\mathit{a}\mathit{x}, \mathrm{i}\mathrm{n}\mathrm{d}\mathrm{e}\mathrm{x} \mathrm{o}\mathrm{f} \mathrm{t}\mathrm{h}\mathrm{e} \mathit{c}\mathit{l}\mathit{a}\mathit{s}\mathit{s} \mathrm{m}\mathrm{a}\mathrm{x}\mathrm{i}\mathrm{m}\mathrm{u}\mathrm{m}$ Output: $\mathit{i}\mathit{m}\mathit{a}\mathit{x}$