Write a C++ program to create a class called CSC254 TREE (Binary tree) with member functions to perform inorder, preorder and postorder traversals. Create a CSC254 TREE object and demonstrate the traversals. Traversal of binary tree refers to the process of visiting each node one-by-one. For binary tree, we generally use the following 3 types of traversal: . Pre-Order 1. Visit the root 2. Traverse the left subtree. 3. Traverse the right subtree . In-Order 1. Traverse the left subtree. 2. Visit the root 3. Traverse the right subtree. Post-Order 1. Traverse the left subtree. 2. Traverse the right subtree. 3. Visit the root Your program should have following functionality cout