Binary Search Tree
Binary Search Tree
h>
#include <stdlib.h>
typedef struct node {
int data;
struct node* left;
struct node* right;
} Node;
Node* newNode(int item) {
Node* temp = (Node*)malloc(sizeof(Node));
temp->data = item;
temp->left = temp->right = NULL;
return temp;
}
Node* insert(Node* node, int key) {
if (node == NULL) return newNode(key);
if (key < node->data)