Rotate the 90-degree output binary tree counterclockwise (Data Structure Test 2)

Rotating a 90-degree print binary tree in a counter-clockwise manner is a special medium-order traversal algorithm.

Rotate 90 degrees counter-clockwise

The implementation is also very simple, similar to the middle-order traversal algorithm. Before the output node value, use a special mark to record the layers and output appropriate spaces.

Code:

Void prtbtree (bitnode * P, int cur) // rotate the 90-degree output binary tree counterclockwise {If (p) {prtbtree (p-> RCH, cur + 1 ); for (INT I = 0; I <= cur; I ++) printf (""); printf ("% 3C", p-> data ); printf ("\ n"); prtbtree (p-> LCH, cur + 1 );}}

Rotate the 90-degree output binary tree counterclockwise (Data Structure Test 2)