Recursion and Concurrency - .NET Parallel Programming - Site Home - MSDN Blogs

Recursion and Concurrency - .NET Parallel Programming - Site Home - MSDN Blogs

Search this blog Search all blogs by by by by Tags When teaching recursion in an introductory computer science course, one of the most common examples used involves a tree data structure.  Trees are useful in this regard as they are simple and recursive in nature, with a tree's children also being trees, and allow for teaching different kinds of traversals (in-order, pre-order, post-order, level-order, and so forth).  But when these introductory concepts meet multithreading, the concepts are no longer so simple, at least not with the tools available in mainstream languages today like C#, C++, and Java. Consider a simple Tree data structure: class Tree     public T Data; // data for this node  } Let's say we want to execute an Action for each datum stored in the tree, and let's assume I don't care about order (introducing parallelism could be questionable if I did).  That's straightforward to do sequentially and recursively: {     // Process the current node, then the left,

Read full article from Recursion and Concurrency - .NET Parallel Programming - Site Home - MSDN Blogs