W3Schools Tryit Editor

Python

Java

#include <stdio.h>
#include <stdlib.h>
typedef struct TreeNode {
 char data;
 struct TreeNode* left;
 struct TreeNode* right;
} TreeNode;
TreeNode* createNewNode(char data) {
 TreeNode* newNode = (TreeNode*)malloc(sizeof(TreeNode));
 newNode->data = data;
 newNode->left = NULL;
 newNode->right = NULL;
 return newNode;
}
void postOrderTraversal(TreeNode* root) {
 if (root == NULL) {
 return;
 }
 postOrderTraversal(root->left);
 postOrderTraversal(root->right);
 printf("%c, ", root->data);
}
int main() {
 TreeNode* root = createNewNode('R');
 TreeNode* nodeA = createNewNode('A');
 TreeNode* nodeB = createNewNode('B');
 TreeNode* nodeC = createNewNode('C');
 TreeNode* nodeD = createNewNode('D');
 TreeNode* nodeE = createNewNode('E');
 TreeNode* nodeF = createNewNode('F');
 TreeNode* nodeG = createNewNode('G');
 root->left = nodeA;
 root->right = nodeB;
 nodeA->left = nodeC;
 nodeA->right = nodeD;
 nodeB->left = nodeE;
 nodeB->right = nodeF;
 nodeF->left = nodeG;
 // Traverse
 postOrderTraversal(root);
 free(nodeG);
 free(nodeF);
 free(nodeE);
 free(nodeB);
 free(nodeC);
 free(nodeD);
 free(nodeA);
 free(root);
 return 0;
}
//C

Python result:

C result:

Java result:

C, D, A, E, G, F, B, R,