Check first two nodes and recursively check remaining .
return ( head . data > head . next . data and isSortedDesc ( head . next ) ) NEW_LINE def newNode ( data ) : NEW_LINE INDENT temp = Node ( data ) NEW_LINE return temp NEW_LINE DEDENT