Question

Provide pseudocode for either preorder traversal or post-order traversal for general trees without recursion (hint: use a stack). Also provide pseudocode for breadth-first level order) traversal for general trees (hint: use a data structure that you studied before).

Provide pseudocode for breadth-first (level order) traversal for general trees. All I need is the breadth-first one, I know the post-order one. So far I knew stack, list, Queues.

Answer 1

`Hey,

Note: Brother if you have any queries related the answer please do comment. I would be very happy to resolve all your queries.

The BFS algorithm is implmented by: Using a queue to store the nodes in the toVisitNodes data structure.

Pseudo code:

Set all nodes to "not visited"; q = new Queue(); q.enqueue(initial node); while ( q ≠ empty ) do { x = q.dequeue(); if ( x has not been visited ) { visited[x] = true; // Visit node x ! for ( every edge (x, y) /* we are using all edges ! */ ) if ( y has not been visited ) q.enqueue(y); // Use the edge (x,y) !!! } }

Kindly revert for any queries

Thanks.