Data Structure Binary Tree: Check for Children Sum Property in a Binary Tree

http://www.geeksforgeeks.org/check-for-children-sum-property-in-a-binary-tree/

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
using namespace std;

struct node {
    int data;
    struct node *left, *right;
    node() : data(0), left(NULL), right(NULL) { }
    node(int d) : data(d), left(NULL), right(NULL) { }
};

void print(node *node) {
    if (!node) return;
    print(node->left);
    cout << node->data << " ";
    print(node->right);
}

bool isSumproperty(node *root) {
    if (!root || !root->left && !root->right) return true;
    int sum = 0;
    sum += root->left != NULL? root->left->data : 0;
    sum += root->right != NULL? root->right->data : 0;
    return sum == root->data && isSumproperty(root->left) && isSumproperty(root->right);
}


int main() {
    struct node* root = new node(10);
    root->left = new node(8);
    root->right = new node(2);
    root->left->left = new node(3);
    root->left->right = new node(5);
    root->right->right = new node(2);
    if (isSumproperty(root)) cout << "yes" << endl;
    else cout << "NO" << endl;
    return 0;
}