Persistent segment tree help

Can anyone tell, how persistent segment tree formed with example( you can include images , if possible ) , for any type of problem involving persistent segment tree , like Kth element in a range from [L to R] after sorting the range in an Array . I don’t want the code , as codes are available on the internet , just want only the structure because i can’t able to visualize the structure.

1 Like
//