private void dump(PrintWriter p, Node<V> node, int depth) {
        p.printf("<%d> %s%n", depth, node);
        node.children.values().forEach(child -> dump(p, child, depth + 1));
    }
Checks a {@link Node} which is mapped to the given {@code path}.
Returns {@code null} if the given {@code path} does not start with the path of this {@link Node}.
Returns {@link #continueWalking()} if the given {@code path} has to visit {@link Node#children}.
core/src/main/java/com/linecorp/armeria/server/RoutingTrie.java