Command line coursera

          
//Binary Search Tree (BST): Function to search a value
bool BST_SearchTree(int Key){
    int  ValueInTree = false;
    TreeNode *temp;
    temp = root;
    while((temp != NULL) && (temp->Key != Key))
    {
        if(Key < temp->Key)
            temp = temp->left; 
        else
            temp = temp->right;
    }
    if(temp == NULL) 
		cout<< "NOT FOUND";
    else
        cout<< "FOUND";
}

Source: courses.edx.org

Similar codes

0 vote127 views1 answer
Full installation of clang in ubuntu
C
2 votes140 views2 answers
Curl authorization header
C
0 vote125 views1 answer
Gcc options to find out makefiel rules
C
0 vote137 views1 answer
Sue murry
C
8 votes167 views2 answers
Millis()
C
0 vote121 views1 answer
Adding strings in the list
C
0 vote131 views1 answer
Atomic variable c
C
0 vote146 views1 answer
Graphics in C Draw A Line
C
1 vote145 views1 answer
Array reference argument
C
0 vote147 views2 answers
C float to string
C