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

Function main

Trees/avltree.c:208–228  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

206}
207
208int main()
209{
210 struct Node *root = NULL;
211
212 root = insertNode(root, 2);
213 root = insertNode(root, 1);
214 root = insertNode(root, 7);
215 root = insertNode(root, 4);
216 root = insertNode(root, 5);
217 root = insertNode(root, 3);
218 root = insertNode(root, 8);
219
220 printPreOrder(root);
221
222 root = deleteNode(root, 3);
223
224 printf("\nAfter deletion: ");
225 printPreOrder(root);
226
227 return 0;
228}

Callers

nothing calls this directly

Calls 3

printPreOrderFunction · 0.85
insertNodeFunction · 0.70
deleteNodeFunction · 0.70

Tested by

no test coverage detected