PROGRAMMING:Establishment and traversal of threaded binary tree

This problem requires the realization of the establishment of the binary tree and the traversal of the binary tree.
![ Picture 1. PNG] (~ / cbddbd25-6078-4953-9592-291c1eef7b9c. PNG)
###Input format:
The input is a precedence sequence
###Output format:
The output is the node value of the middle order traversal cue tree and the left and right pointer information of the node.
###Input example:
Here is a set of inputs. For example:
```in
AB@D@@CE@@@
```
###Output example:
```out
B 1 0
D 1 1
A 0 0
E 1 1
C 0 1
```







answer：If there is no answer, please comment