node* searchBST(node* root, int val) { while(root!=NULL||root->data!=val) { if(root->data>val) root=root->left; else root=root->right; } return root; }
Preview:
downloadDownload PNG
downloadDownload JPEG
downloadDownload SVG
Tip: You can change the style, width & colours of the snippet with the inspect tool before clicking Download!
Click to optimize width for Twitter