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

Function minValueNode

Trees/avltree.c:119–127  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

117}
118
119struct Node *minValueNode(struct Node *node)
120{
121 struct Node *current = node;
122
123 while (current->left != NULL)
124 current = current->left;
125
126 return current;
127}
128
129// Delete a nodes
130struct Node *deleteNode(struct Node *root, int key)

Callers 1

deleteNodeFunction · 0.85

Calls

no outgoing calls

Tested by

no test coverage detected