This paper introduces a series of methods for traversing binary decision trees using arithmetic operations. We present a suite of binary tree traversal algorithms that leverage novel representation matrices to flatten the full binary tree structure and embed the aggregated internal node Boolean tests into a single binary vector. Our approach, grounded in maximum inner product search, offers new insights into decision tree.

翻译：本文介绍了一系列利用算术运算遍历二叉决策树的方法。我们提出了一套二叉树遍历算法，这些算法通过新颖的表示矩阵将完全二叉树结构扁平化，并将聚合的内部节点布尔测试嵌入到单个二进制向量中。基于最大内积搜索的方法为决策树研究提供了新的视角。