Assume we have a double linked list. After executing this line of code, which of the following will print the value in the second node? " head "- > " next "=" head "- > " next "- > " next; " cout next->prev->value; cout value; cout Which of the following is not correct about a non-empty binary tree? * There is at least one leaf node. All are correct The maximum number of children for a node is 2 A leaf may have one or more parents Assume we have a double linked list. After executing this line of code, which of the following will print the value in the second node? head>next=head>next>next; cout next->prev->value; cout value; cout next->value; we cannot print it anymore