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

Function newNode

CPP/Trees/kthMinimumElement.cpp:12–18  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

10};
11
12struct node *newNode(int item)
13{
14 struct node *temp = (struct node *)malloc(sizeof(struct node));
15 temp->key = item;
16 temp->left = temp->right = NULL;
17 return temp;
18}
19struct node *insert(struct node *node, int key)
20{
21 if (node == NULL)

Callers 1

insertFunction · 0.70

Calls

no outgoing calls

Tested by

no test coverage detected