已知二叉树前序、中序遍历，求后序遍历代码,C代码库,德仔网

代码语言

代码分类

【C】已知二叉树前序、中序遍历，求后序遍历

作者:凡程子 / 发布于2013/1/8/ 759

#include <iostream>  
 #include <fstream>  
 #include <string>  
 
 struct TreeNode
 {
   struct TreeNode* left;
   struct TreeNode* right;
   char  elem;
 };
 
 void BinaryTreeFromOrderings(char* inorder, char* preorder, int length)
 {
   if(length == 0)
     {
       //cout<<"invalid length";
       return;
     }
   TreeNode* node = new TreeNode;//Noice that [new] should be written out.
   node->elem = *preorder;
   int rootIndex = 0;
   for(;rootIndex < length; rootIndex++)
     {
       if(inorder[rootIndex] == *preorder)
       break;
     }
   //Left
   BinaryTreeFromOrderings(inorder, preorder +1, rootIndex);
   //Right
   BinaryTreeFromOrderings(inorder + rootIndex + 1, preorder + rootIndex + 1, length - (rootIndex + 1));
   cout<<node->elem<<endl;
   return;
 }
 
 
 int main(int argc, char* argv[])
 {
     printf("Hello World!\n");
     char* pr="GDAFEMHZ";
     char* in="ADEFGHMZ";
   
     BinaryTreeFromOrderings(in, pr, 8);
 
     printf("\n");
     return 0;
 }

试试其它关键字

　后序遍历　

同语言下

可能有用的

凡程子贡献的其它代码(4)