protected int traverse(DecisionNode node, SubtableEntryVisitor visitor) {
		Iterator<DisjointPattern> pit = node.getPatterns().iterator();
		Iterator<Constructor> cit = node.getConstructors().iterator();
		while (pit.hasNext()) {
			int result = visitor.visit(pit.next(), cit.next());
			if (result != CONTINUE) {
				return result;
			}
		}
		for (DecisionNode child : node.getChildren()) {
			int result = traverse(child, visitor);
			if (result != CONTINUE) {
				return result;
			}
		}
		return CONTINUE;
	}
A recursive method to descend down each branch of the decision tree for a table
@param node the current node
@param visitor the visitor to call back
@return a value from {@link VisitorResults}
Ghidra/Framework/SoftwareModeling/src/main/java/ghidra/app/plugin/languages/sleigh/SleighSubtableTraversal.java