Tlie standard methods for tree searching, such as breadth first and depth first searches suffer from space and time limitat,ions respectively. The depth first iterative deepening t,ree searching method attempts to overcome the limitations of these standard methods of tree searching. However, this is not optimal in space. A new method for searching tree that uses reduced amount of space is developed. The proposed method is a combination of breadth first, minimum space pebbling strategy and tjhe modified iterative deepening depth first searches.