Write a program to create a binary search tree where each node has a counter to store how many times its value occurs in the tree, and then prints the pre-order, in-order and post-order transversals of the modified tree. The values that occur more than once are followed with their quantity noted in parenthesis. Input from the keyboard a single line of integer numbers separated by spaces. Assume proper input and no more than 30 values. Output to the screen the pre order, in order, and post order traversals on separate lines. Quantities larger than one are denoted with parenthesis. Each row must be properly labeled and use a minimum of one space between each number. Use a tree data structure. Refer to the sample output below. Sample Run:

Enter up to 30 integer values: 7 1 5 7 4 4 1 8 9 7 1 4 2 2 3 5 6 7 12 14 11 12
Pre Order: 7(4) 1(3) 5(2) 4(3) 2(2) 3 6 8 9 12(2) 11 14
In Order: 1(3) 2(2) 3 4(3) 5(2) 6 7(4) 8 9 11 12(2) 14
Post Order: 3 2(2) 4(3) 6 5(2) 1(3) 11 14 12(2) 9 8 7(4)