二叉树重建(前+中,后+中,层+中)
前+中struct node { int num; node* l, * r; node(int elem, node* n1 = nullptr, node* n2 = nullptr) { num = elem; l = n1, r = n2; }};int mei[20], pre[20];node* build(int lp,int rp,int lm,int rm) { if (lm > rm || lp &
原创
2022-04-22 11:25:59 ·
255 阅读 ·
0 评论