How do you implement this in Java using ArrayList?

DFS

begin open :- [Start]; closed := [ ]; while open [ ] do % initialize % states remain begin remove leftmost state from open, call it X; if X is a goal then return SUCCESS % goal found else begirn generate children of X; put X on closed; discard children of X if already on open or closed; put remaining children on left end of open % loop check % stack end end return FAIL % no states left end