Hi all
I am traverse a tree (radial)in a certain order.I believe that it is a depth first traversal but preorder traversal also gives me the same result.
Now I m confused about the jargon whether to use depth first or preorder.
Please advise
Thanks
Hi everyone
Could anyone please provide me an algortihm for building a non-binary(unsymmetrical tree) using C++,I am also interested in traversing the tree.
I would be even happy with an outline of how it can be implemented
Thanks
Thiru
I am trying to access a record of a table.I have written the follwoing code.But when I try to compile it gives some errors
fxcwd.lib(thrdcore.obj) : error LNK2001: unresolved external symbol __endthreadex
nafxcwd.lib(thrdcore.obj) : error LNK2001: unresolved external symbol __beginthreadex...
Could you please help me by letting me know how to open a MS Access file(for now a single column of data) and read it.
Your response would be of great help to me
Thanks
Thiru
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.