int arr[100]= {0}; int cnt = 0; void printtree(struct TreeNode* p){ if(p == NULL) return; printtree(p->left); printtree(p->right); arr[cnt++] = p->val; } int* postorderTraversal(struct TreeNode* root, int* returnSize ) { printtree(root); *returnSize = cnt; return arr; }