We will show how to implement binary decision tree traversal in the language of matrix computation. Our main contribution is to propose some equivalent algorithms of binary tree traversal based on a novel matrix representation of the hierarchical structure of the decision tree. Our key idea is to travel the binary decision tree by maximum inner product search. We not only implement decision tree methods without the recursive traverse but also delve into the partitioning nature of tree-based methods.

翻译：我们将展示如何在矩阵计算的语言中实现二叉决策树遍历。我们的主要贡献是基于决策树层次结构的新型矩阵表示，提出了一些二叉树遍历的等价算法。我们的核心思想是通过最大内积搜索来遍历二叉决策树。我们不仅实现了无需递归遍历的决策树方法，还深入探讨了基于树的方法的分区本质。