Hi, i have and assignment and the question is "Given this binary tree, write an algorithm to render the leaf nodes (a) depth first, (b) breadth first. - Given two books (as strings), find intersection of words between both" could some please help me to just understand how i start answering it or even answer it please thanks.