Code for linked representation of a binary tree in c plus plus?

Answer 1

#include<iostream>

template<typename T>

struct node

{

T data;

node* left {nullptr};

node* right {nullptr};

node (const T& value): data (value) {}

~node () { delete left; delete right; }

void insert (const T& value)

{

if (value < data)

{

if (left)

left->insert (value);

else

left = new node (value);

}

else

{

if (right)

right->insert (value);

else

right = new node (value);

}

}

};

template<typename T>

struct bin_tree

{

node<T>* root {nullptr};

~bin_tree () { delete root; }

void insert (const T& value)

{

if (!root)

root = new node<T> (value);

else

root->insert (value);

}

};

template<typename T>

std::ostream& operator<< (std::ostream& os, const node<T>& n)

{

if (n.left) os << (*n.left);

os << n.data << ' ';

if (n.right) os << (*n.right);

return os;

}

template<typename T>

std::ostream& operator<< (std::ostream& os, const bin_tree<T>& t)

{

if (t.root)

return os << (*t.root);

return os;

}

int main()

{

int arr[10] = {42, 56, 30, 5, 12, 60, 40, 8, 1, 99};

bin_tree<int> tree;

for (size_t e=0; e!=10; ++e)

tree.insert (arr[e]);

std::cout << tree << std::endl;

}