Introduction - If you have any usage issues, please Google them yourself
Write a program to implement the following operations of a two fork tree: 1) input a preorder sequence of a two fork tree to generate a two chain list of two forked trees. 2) showed that the first order, the order and post order traversal results 3) calculate the number of leaf nodal points of the two forked tree. 4) the depth of the two forked tree