Using breadth first search in binary trees