摘要：题干 Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to 阅读全文

摘要：#include<iostream> #include<cstdio> using namespace std; float a, b, c, d; float l, r; float clac(float x){ return a * x * x * x + b * x * x + c * x + 阅读全文