I think the question is about binary tree, not binary "search" tree Think about DFS (using queue, arraylist) and BFS (using recursive function - with preorder, inorder, or postorder)