(1). Create a BST with a single node as its Root Node;
(2). Add a node with a given Key Value (give error message, if Key Value already exists, else add a node);
(3). Given a Key Value, delete a node if it exists; else give error message that the Key Value does not exist;
(4). Perform search for a given Key Value; if it exists, output " Element Found", else output "Doesn't Exist in the tree";
(5). Perform In-order, Pre-order, Post-order traversal of a given BST and print Key Values in a row, separated by vertical bars;