#include using namespace std;

class node { int value; node* left; node* right;

public: node(int value, node* left, node* right) { this->value = value; this->left = left; this->right = right; }

void add(int value) { if (value < this->value) { if (left == nullptr) left = new node(value, nullptr, nullptr); else left->add(value); } else { if (right == nullptr) right = new node(value, nullptr, nullptr); else right->add(value); } }

void print() { if (left != nullptr) left->print(); cout << value << " "; if (right != nullptr) right->print(); }

//Return the sum of all the numbers in the tree int sum() { // Your code starts here

// Your code ends here }

//Prints all the leaves in the tree (i.e. nodes that have no children) void print_leaves() { // Your code starts here

// Your code ends here }

//Finds the largest number in the tree int max() { // Your code starts here

// Your code ends here } }; //After