CareerCup

Breadth first traversal using a queue. First push the parent then its siblings in the queue and each time you pull a node out from the queue add its children to the end of the queue.

It sounds like a heap or a binary heap to me,
and since priority queue sues a heap as the base data structure, r we allowed to use binary max/min heap?

The value of each node is TRUE or FALSE.
The goal is to find the highest-level node that is TRUE.
So what you would do is access each sibling node recursively,
storing the children (if there is one) in a queue.
After accessing all siblings, proceed to pop nodes off the queue and search them recursively.

Same as BFS

BFS is the only search which looks for the sibling first then children.

I think we need to do a DFS and NOT BFS...DFS will first cover all siblings before children...comments please

DFS sounds to be the right choice.

bool Search(node* root, in i)
{
	if(root == NULL)
		return false;
	if( root->data == i || Search(root->next, i) || Search(root->child, i))
		return true;
	return false;
}

BFS using queue will solve the problem