opencl graphs and data structures

i’m interested in creating /traverse ,binary trees and graphs in general on gpu.
There is a book(better) or other documentation on data structures for gpus?

CPU- like trees and graph on GPU memory are inefficient by meny global memory lookups.
Typical representation of a graph stucture, like Deterministic automaton, is a lookup table of
nodes. Look in Wikipedia, how its organised. You can perform binary tree operations, like SCAN and binary search with local memory optimisations. Howewer, you can have any linked ( like in CPU , but indexes instead of direct pointers) memory structure in local memory since it is fast, remember only dont have array index out of bounds, there is usualy no error message about it.
All you need , is practice. Try to make thay by yourself and post here
Good luck )