编写程序，首先建立如下图所示的带头结点的二叉链存储结构二叉树，然后把二叉树顺时针旋转90度后在屏幕上打印该二叉树，然后输出分别按照前序遍历（含递归与非递归两种方法），中序遍历，后序遍历以及层次遍历等方法遍历二叉树次序访问各结点的序列信息，并验证结果正确与否，并实现在该二叉树中查找某结点数据的方法。-Programming, first of all to establish a lead as follows node chain store binary tree structure, and then the tree after 90 degrees clockwise on the screen print of the tree, and then the output sequence, respectively, in accordance with the preceding times calendar (including recursive and non-recursive two methods), in order traversal, after traversal and traversal methods such as the level of binary tree traversal order of visits to the sequence of node information, and verify that the results are correct or not, and to achieve in the tree to find a node data.