//C++ snippet
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
 
struct node{
    int val;
    node *left;
    node *right;
}*root;
 
int main() {
 
	node *tmp = (node *)malloc(sizeof(node *));
    tmp->val = 5;
    tmp->left = NULL;
    tmp->right = NULL;
    root = tmp;
 
	cout<<sizeof(node)<<" "<<sizeof(node*)<<endl;
    node *t = (node *)malloc(sizeof(node *));
    cout<<"earlier: "<<&root->right<<" "<<root->right<<endl;
    t->val = 4;
    cout<<"after: "<<&root->right<<" "<<root->right<<endl;
    t->left = NULL;
    t->right = NULL;
    root->left = t;
 
	return 0;
}

Ly9DKysgc25pcHBldAojaW5jbHVkZSA8Y21hdGg+CiNpbmNsdWRlIDxjc3RkaW8+CiNpbmNsdWRlIDx2ZWN0b3I+CiNpbmNsdWRlIDxpb3N0cmVhbT4KI2luY2x1ZGUgPGFsZ29yaXRobT4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCnN0cnVjdCBub2RlewogICAgaW50IHZhbDsKICAgIG5vZGUgKmxlZnQ7CiAgICBub2RlICpyaWdodDsKfSpyb290OwoKaW50IG1haW4oKSB7CgkKCW5vZGUgKnRtcCA9IChub2RlICopbWFsbG9jKHNpemVvZihub2RlICopKTsKICAgIHRtcC0+dmFsID0gNTsKICAgIHRtcC0+bGVmdCA9IE5VTEw7CiAgICB0bXAtPnJpZ2h0ID0gTlVMTDsKICAgIHJvb3QgPSB0bXA7CgoJY291dDw8c2l6ZW9mKG5vZGUpPDwiICI8PHNpemVvZihub2RlKik8PGVuZGw7CiAgICBub2RlICp0ID0gKG5vZGUgKiltYWxsb2Moc2l6ZW9mKG5vZGUgKikpOwogICAgY291dDw8ImVhcmxpZXI6ICI8PCZyb290LT5yaWdodDw8IiAiPDxyb290LT5yaWdodDw8ZW5kbDsKICAgIHQtPnZhbCA9IDQ7CiAgICBjb3V0PDwiYWZ0ZXI6ICI8PCZyb290LT5yaWdodDw8IiAiPDxyb290LT5yaWdodDw8ZW5kbDsKICAgIHQtPmxlZnQgPSBOVUxMOwogICAgdC0+cmlnaHQgPSBOVUxMOwogICAgcm9vdC0+bGVmdCA9IHQ7CgkKCXJldHVybiAwOwp9

MSAyIDUgNA==

1 2 5 4