Struktur Data

Berikut source code program binary tree c++: #include<iostream> #include<stdio.h> #include<conio.h> #include<stdlib.h> using namespace std; struct tree_node{ tree_node* left; tree_node* right; int data; }; tree_node* root; bool isEmpty() {return root==NULL;} void insert(int d) { tree_node* t = new tree_node; tree_node* parent; t->data = d; t->left = NULL; t->right = NULL; parent = NULL; if(isEmpty())root = t; else {     tree_node* curr;     curr = root;     while(curr!=NULL) {         parent = curr;         if(t->data > curr->data) curr = curr->right;         else curr = curr->left;     }     if(t->data < parent->data)         parent->left = t;     else         parent->right = t; }} void inorder(tree_node* p) { if(p!=NULL) {     if(p->left)         inorder(p->left);     cout<<" "<<p->data<<" &q