Implementing Binary Search Tree on GPU

Accelerated Computing CUDA CUDA Programming and Performance
1

Hello All,

I want to make a fast implementation of Binary Search Tree.

So for that i want to make use of compute capacity of my GPU.

The idea is the the tree should be generated collaboratively by
multiple core of the GPU.

So if anybody has any idea of how to do this on the GPU, then please
tell me.

Regards,
Raman Sehgal

2

Perform the sorting on GPU and then choose your Root of the tree as the CENTER element and keep adding elements from left and right as LEFT and RIGHT children and so on – construct the actual tree on CPU