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

Function findanode

CPP/binarytreeuse.cpp:253–262  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

251}
252
253bool findanode(binarytree<int>*root,int x)
254{
255 if(root==NULL)
256 return false;
257
258 if(root->data==x)
259 return true;
260
261 return findanode(root->left,x) || findanode(root->right,x);
262}
263
264pair<bool,int> balancedhelper(binarytree<int>*root)
265{

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected