[asdk77]

I write a function to search a tree, and find out the node suitable and store them in an array. It is in postorder.

void search_for_node(node *root, node *list[])
{
	int j;
	if (root == NULL)
		return;
	
	
	for(j=0; j<root->num_children; j++)
		search_for_node(root->children[j], list);
	if (root->type == ID)
	list[num_for++] = root;

	
	
}

But it can't work. Is there anything wrong in my code?
Thanks in advance!

[jimblumberg]

Why doesn't it work?

Also posted here.

Jim

[mojo666]

What is "num_for" and "ID"?

This post has been edited by mojo666: 22 January 2013 - 03:32 PM

[asdk77]

mojo666, on 22 January 2013 - 03:31 PM, said:

What is "num_for" and "ID"?

num_for is a global variable counting the number of nodes suitable.
ID is a enum type, and the node structure has a member called type, some of them equals ID.
I think the logic of the function is correct, but when I run the whole program, it won't search the leaf, but just search the children of top.
Now, I am confused.

[asdk77]

It can work!
Thank you for attention!!!