Data Structure Binary Tree: Construct Full Binary Tree from given preorder and postorder traversals

http://www.geeksforgeeks.org/full-and-complete-binary-tree-from-given-preorder-and-postorder-traversals/

 #include <iostream>
 #include <vector>
 #include <algorithm>
 #include <queue>
 #include <stack>
 #include <string>
 #include <fstream>
 #include <map>
 using namespace std;

 struct node {
     int data;
     struct node *left, *right;
     node() : data(), left(NULL), right(NULL) { }
     node(int d) : data(d), left(NULL), right(NULL) { }
 };

 void prints(node *root) {
     if (!root) return;
     prints(root->left);
     cout << root->data << " ";
     prints(root->right);
 }

 node *_buildtree(int pre[], int post[], int &preindex, int l, int h, int size) {
     if (preindex >= size || l > h) return NULL;
     node *root = new node(pre[preindex++]);
     if (l == h) return root;
     int i = l;
     for (; i <= h; i++) if (pre[preindex] == post[i]) break;
     if (i <= h) {
         root->left = _buildtree(pre, post, preindex, l, i, size);
         root->right = _buildtree(pre, post, preindex, i+, h, size);
     }
     return root;
 }

 node *buildtree(int pre[], int post[], int size) {
     int preindex = ;
     return _buildtree(pre, post, preindex, , size-, size);
 }

 int main() {
     int pre[] = {, , , , , , , , };
     int post[] = {, , , , , , , , };
     node *root = buildtree(pre, post, );
     prints(root);
     return ;
 }