How disjoint sparse table(DST) is different from segment tree?

Question

I know simple sparse tree which process idempotent functions in O(1) have completely different formation than segment tree where function f can be minimum function.

l