Question: Which of the following is a valid way to represent a binary tree node in C++?

Options:

1. struct Node { int data; Node* left; Node* right; };
2. class Node { int data; Node* left; Node* right; };
3. struct Node { int data; Node left; Node right; };
4. class Node { int data; Node left; Node right; };

Correct Answer: struct Node { int data; Node* left; Node* right; };

Solution:

The correct representation of a binary tree node in C++ is using a struct with pointers to the left and right children.