文件名称:homework
介绍说明--下载内容均来自于网络,请自行研究使用
设二叉树的结点的数据场之值仅为一大写英文字母。其前序和中序的遍历结果(打印结点的数据场之值)分别保存在字符串数组 preorder[N] 及 inorder[N]之中,其中 N 为常数。请设计程序以标准形式存储保存该二叉树。-Based binary tree node data field of the value is only a capital letter. The pre-order traversal order and the results (the data field to print the node value) were stored in an array of strings preorder [N] and inorder [N], of which N is a constant. Please design process to save the binary tree stored in standard form.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
homework.cpp