MCPcopy Create free account
hub / github.com/codemistic/Data-Structures-and-Algorithms / printPreOrder

Function printPreOrder

Trees/avltree.c:198–206  ·  view source on GitHub ↗

Print the tree

Source from the content-addressed store, hash-verified

196
197// Print the tree
198void printPreOrder(struct Node *root)
199{
200 if (root != NULL)
201 {
202 printf("%d ", root->key);
203 printPreOrder(root->left);
204 printPreOrder(root->right);
205 }
206}
207
208int main()
209{

Callers 1

mainFunction · 0.85

Calls

no outgoing calls

Tested by

no test coverage detected