print level order traversal tree nodes from left to right using an input file in the format of (6, L)(8, R)(4, )(10, LL)() in an output file [using c++]?

input is given in (k,s) where k represents the value at the node whose path from the root is given by the string s. A path is given by a sequence of L's and R's here L represent left branch and R represent right branch.

The input is a sequence of binary trees, stored in a file named txt.in. Each tree is a sequence consists of several pairs (n, s) as described above separated by whitespace. The last entry in each tree is () with no whitespace appears between left and right parentheses. All nodes contain a number. Every tree in the input will consist of at least one node and no more than 256 nodes. Input is terminated by end-of-file.

The Output:

For each completely specified binary tree in the input file, the level order traversal of that tree should be printed. If a tree is not completely specified, i.e., some node in the tree is NOT given a value or a node is given a value more than once, then the string ``not complete'' should be printed. Output should be stored in a file named op.out.