Search procedure, which looks for the input key in the tree and returns 1 if * it's present or 0 if it's not in the tree * @param root pointer to parent node * @param data value to store int he new node * @returns 0 if value not found in the nodes * @returns 1 if value was found */
source not stored for this graph (policy: none)