Arithmetical Binary Decision Tree Traversals

This paper introduces a series of methodes 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 bitvector. Our approach, grounded in maximum inner product search, offers new insights into decision tree.