IT Placement Papers Programming DataStructure
This category contains DataStructure Interview Questions and Answers |
Print a data from a binary tree – In-order(ascending)
|
|
|
|
|
// // recursive version //
Void PrintTree ( struct * node node ) { if ( node == NULL ) return;
PrintTree(node->left ); Printf(“%d”, node->data); PrintTree(node->right ); }
Only registered users can write comments. Please login or register.
|