BinTreeInsert, C++ (gcc)

Language: Layout:

//g++  7.4.0
//Binary Tree: Insert operation
//code credit Geeks for Geeks 
#include <bits/stdc++.h>
using namespace std;
 
class node {
public:
    int data;
     node *left, *right;
};
 
//  create a new binary tree node
 node* addNew(int item)
{
     node* temp
        = (node*)malloc(sizeof( node));
    temp->data = item;
    temp->left = temp->right = NULL;
    return temp;
}
 
// inorder traversal 
void inorder( node* root)
{
    if (root != NULL) {
        inorder(root->left);
        cout <<" "<<root->data;
        inorder(root->right);
    }
}
//Pre order traversal
void preorder( node *temp) {
  if (temp != NULL) {
    cout << " " << temp->data;
    preorder(temp->left);
    preorder(temp->right);
  }
}
//Post Order traversal
void postorder( node *temp) {
  if (temp != NULL) {
    postorder(temp->left);
    postorder(temp->right);
    cout << " " << temp->data;
  }
}

// Insert a new node with given data 
 
 node* insert( node* node, int d)
{
    
    if (node == NULL)
        return addNew(d);
    if (d < node->data)
        node->left = insert(node->left, d);
    else
        node->right = insert(node->right, d);
 
    
    return node;
}

int main()
{
node* root=NULL;
root= insert(root,90);
root= insert(root,80);
root= insert(root,70);
root= insert(root,100);
root= insert(root,110);
cout <<"Pre order:\n";
preorder(root);
cout<<endl;
cout <<"In order:\n";
inorder(root);
cout<<endl;
cout <<"Post order:\n";
postorder(root);
cout<<endl;
return 0;
}

Show compiler warnings [ + ] Compiler args [ + ] Show input
Compilation time: 2.03 sec, absolute running time: 0.18 sec, cpu time: 0.02 sec, memory peak: 5 Mb, absolute service time: 2,28 sec