//Created by Jihad Naji (Kurdi) // Binary Search Tree Implementation. Insert(), PrintInOrder(), PrintPreOrder(), amd PrintPostOrder() #include using namespace std; struct Node { int key; Node *left; Node *right; }; Node *NewNode(int item) { Node *temp = new Node; temp->key = item; temp->right = NULL; temp->left = NULL; return temp; } Node *Insert(Node *node, int key) { if (node == NULL) return NewNode(key); if (key < node->key) node->left = Insert(node->left, key); else node->right = Insert(node->right, key); return node; } void PrintPostOrder(Node *node) { if (node == NULL) return; PrintPostOrder(node->left); PrintPostOrder(node->right); cout << node->key << " "; } void PrintInOrder(Node *node) { if (node == NULL) return; PrintInOrder(node->left); cout << node->key << " "; PrintInOrder(node->right); } void PrintPreOrder(Node *node) { if (node == NULL) return; cout << node->key << " "; PrintPreOrder(node->left); PrintPreOrder(node->right); } Node *Search(Node *root, int key) { if (root == NULL || root->key == key) return root; if (root->key < key) return Search(root->right, key); return Search(root->left, key); } int main() { Node *root = NULL; root = Insert(root, 50); Insert(root, 30); Insert(root, 20); Insert(root, 40); Insert(root, 70); Insert(root, 60); Insert(root, 80); cout << "InOrder Traversal: "; PrintInOrder(root); cout << endl; cout << "PreOrder Traversal: "; PrintPreOrder(root); cout << endl; cout << "PostOrder Traversal: "; PrintPostOrder(root); cout << endl; Node *temp = Search(root, 40); cout << "Item: " << temp->key << " is founded"; cout << endl; cout << "\n\n"; cout << "|================================|" << endl; cout << "| Created by: Jihad Naji (Kurdi) |" << endl; cout << "| I hope u would like it |" << endl; cout << "|================================|" << endl; return 0; }