利用随机函数产生100个(不大于100且各不相同的)随机整数，用这些整数来生成一棵二叉树，分别对二叉树进行先序遍历，中序遍历和后序列遍历输出树中结点元素序列。注意：先序遍历输出要求采用非递归来实现。-Using random functions to generate 100 (not more than 100 and different) random integer, use the integer to generate a binary tree, respectively, for the first tree traversal, in order traversal sequence and post-times calendar output tree node element sequence. Note: The first traversal output required to achieve non-recursive.