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

Function preOrder

Trees/binarytreetraversal.c:41–48  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

39
40
41 void preOrder(struct tnode *node) {
42 if (node) {
43 printf("%d ", node->data);
44 preOrder(node->left);
45 preOrder(node->right);
46 }
47 return;
48 }
49
50
51 void inOrder(struct tnode *node) {

Callers 1

mainFunction · 0.85

Calls

no outgoing calls

Tested by

no test coverage detected