Can someone tell me how I can produce recursive solutions in javascript for BFS and DFS?

Question

I know how to do these iteratively for Binary Search Trees, Adjacency Lists, and Adjacency Matrix. But I want to learn the recursive solutions for these, I am having a hard time