$[$Write a C$++$ code to implement Binary Search Tree operations $($insertion$,$ traversal and searching$)$

$**$perform time complexity for the above program

Do the following to write program for a BST:

To construct a binary search tree of integers $($insert one by one$).$

To traverse the tree using all the methods i$.$e$.,$ in order, preorder and post order.

To search an element on a given BST$.]$

Now then, implement a program using BST to store information of students with the following details such as id$,$ name and CGPA. You can use unique id of a student to search and insert different data.

Note: Each node will contain three information: id$,$ name and CGPA but id will be used for searching data in the BST