摘要：
这道题是给出你二叉树的中序遍历和前序遍历，让求后序遍历。思路很简单，先建立一颗二叉树，之后再后序遍历二叉树即可。题目：Binary Tree TraversalsTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1326Accepted Submission(s): 633Problem DescriptionA binary tree is a finite set of vertices that is either empty or co. 阅读全文
浙公网安备 33010602011771号