If someone could help me with this code that would be awesome. It is in C++

Problem: Write a C++ program that takes as input, a fully parenthesized, arithmetic expression and converts it to a binary expression tree. You program should display the tree in some way and also print the value associated with the root Example: (3 + (5+9) 2) 2 5 9 Help: You may use the STACK STL of C++. Stacks are a type of container adaptors with LIFO (Last In First Out) type of working, where a new element is added at one end and (top) an element is removed from that end only. The functions associated with stack are: empty0 Returns whether the stack is empty size0 Returns the size of the stack Reference: http://www.geeksforgeeks.org/expression-tree/ top0) - Returns a reference to the top most element of the stack push(i)-Adds the element l at the top of the stack pop)- Deletes the top most element of the stack