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

Function main

CPP/Trees/kthMinimumElement.cpp:49–60  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

47}
48
49int main()
50{
51 int k = 1;
52 struct node *root = NULL;
53 root = insert(root, 5);
54 insert(root, 2);
55 insert(root, 1);
56 insert(root, 9);
57 insert(root, 5);
58 insert(root, 8);
59 cout << "The " << k << "st smallest element in Binary search tree is " << findKthMin(root, k);
60}

Callers

nothing calls this directly

Calls 2

findKthMinFunction · 0.85
insertFunction · 0.70

Tested by

no test coverage detected