Abstract: We give a quantum algorithm for the binary NAND tree problem in the Hamiltonian oracle model. The algorithm uses a continuous time quantum walk with a running time proportional to N. We also show a lower bound of ( N) for the NAND tree problem in the Hamiltonian oracle model.