Say I have this C++ code (it's from a binary tree problem)
if(t->left != nullptr && t->left->data != t->data)
Isn't it problematic since I try to access possibly a nullpointer's data? Or does it work? because the boolean evaluation happens in a specific order.