Hi !

I have just begun to learn c.Will u pls help me with the following questions??

1. WRITING PROGRAM TO LIST THE NODES OF BINARY TREE FIRST LISTING THE ROOT,THEN NODES AT DEPTH 1,THEN AT DEPTH 2,ETC..THE PROGRAN SHUD HAVE LINEAR TIME COMPLEXITY.

2. LET G = (V, E) BE UNDIRECTED GRAPH.HOW DO I USE A DEPTH FIRST SEARCH TO DEVELOP A PROGRAM IN C TO CONVERT EACH EDGE IN G TO A DIRECTED EDGE SUCH THAT THE RESULTING GRAPH IS CONNECTED OR TO DETERMINE THAT THIS IS NOT POSSIBLE.