A binary tree can be naturally implemented by pointers.
{"Image DocumentName": "A binary tree can be naturally implemented by pointers.", "Image ImageDescription": "Struct Node { double element; // the data. Node  left; // left child. Node  right; // right child. // Node  parent; // parent. } class Tree { public: Tree(); // constructor. Tree(const Tree& t); ~Tree(); // destructor. bool empty() const; double root(); // decomposition (access functions) Tree& left(); Tree& right(); // Tree& parent(double x); // \u2026 update \u2026 void insert(const double x); // compose x into a tree. void remove(const double x); // decompose x from a tree. private: Node  root; A binary tree can be naturally implemented by pointers.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}