text: A recursive function to print the paths whose maximum element is greater than or equal to K .
code: void findPathUtil ( Node * root , int k , vector < int > path , int flag , int & ans ) { if ( root == NULL ) return ;