fork download
  1. #include<iostream>
  2. using namespace std;
  3.  
  4. struct Node
  5. {
  6. int data;
  7. Node *Next;
  8. };
  9.  
  10. bool compareAddresses(void* ptr1, void* ptr2){
  11. return ptr1 == ptr2;
  12. }
  13.  
  14. int main()
  15. {
  16. Node *Node1=new Node;
  17. Node *Node2=new Node;
  18.  
  19. Node1->data=11;
  20. Node1->Next=Node2;
  21.  
  22. Node2->data=22;
  23. Node2->Next=NULL;
  24.  
  25. if (compareAddresses(Node1->Next, &Node2->data)) //1
  26. cout<<"Node1->Next==&Node2->data"<<endl; //2
  27.  
  28. cout<<"Node1->Next="<<Node1->Next<<" &Node2->data="<<&Node2->data<<endl;//3
  29.  
  30. if (compareAddresses(Node2, &Node2->data)) //4
  31. cout<<"Node2==&Node2->data"<<endl; //5
  32.  
  33. cout<<"Node2="<<Node2<<" &Node2->data="<<&Node2->data<<endl; //6
  34.  
  35. if(compareAddresses(Node1->Next, Node2)) //7
  36. cout<<"Node1->Next==Node2"<<endl; //8
  37.  
  38. cout<<"Node1->Next="<<Node1->Next<<" Node2="<<Node2<<endl; //9
  39. }
Success #stdin #stdout 0s 16064KB
stdin
Standard input is empty
stdout
Node1->Next==&Node2->data
Node1->Next=0x2b5e75c5fc40  &Node2->data=0x2b5e75c5fc40
Node2==&Node2->data
Node2=0x2b5e75c5fc40   &Node2->data=0x2b5e75c5fc40
Node1->Next==Node2
Node1->Next=0x2b5e75c5fc40   Node2=0x2b5e75c5fc40