上帝王牌：给出先序遍历和中序遍历，求后续遍历，要求：

函数头如下：

bool getPostOrder(const char* perOrder, const char* inOrder, char* postOrder)

返回值是一个布尔 代表是否有这样的二叉树



用法：

char* perorder = "abdgcefh"

char* inorder = "dgbaechf" 或者 char* inorder = "abcde"

char postorder[1000]

if (getPostOrder(perorder, inorder, postorder))

{

print("Post order is s", postorder)

}

else

{

print("No such tree")

}-God trump card, the first order is given, and in order traversal traversal traversal seek follow-up, request: function header is as follows: bool getPostOrder (const char* perOrder, const char* inOrder, char* postOrder)　return value is a boolean whether this is representative of binary Usage: char* perorder = " abdgcefh"　 char* inorder = " dgbaechf"　or char* inorder = " abcde"　 char postorder [1000]　if (getPostOrder (perorder, inorder, postorder)) (print ("　Post order is　s " , postorder) ) else (print ("　No such tree " ) )