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

Function createNode

Trees/binarytreetraversal.c:12–19  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

10
11
12 struct tnode * createNode(int data) {
13 struct tnode *newNode;
14 newNode = (struct tnode *) malloc(sizeof(struct tnode));
15 newNode->data = data;
16 newNode->left = NULL;
17 newNode->right = NULL;
18 return (newNode);
19 }
20
21
22 void insertion(struct tnode **node, int data) {

Callers 2

insertionFunction · 0.85
addOneRowMethod · 0.85

Calls

no outgoing calls

Tested by

no test coverage detected