diff --git a/PostorderTraversal.cpp b/PostorderTraversal.cpp
new file mode 100644
index 0000000..395b2d7
--- /dev/null
+++ b/PostorderTraversal.cpp
@@ -0,0 +1,38 @@
+// C++ program for different tree traversals
+#include <iostream>
+using namespace std;
+
+struct Node {
+	int data;
+	struct Node *left, *right;
+	Node(int data)
+	{
+		this->data = data;
+		left = right = NULL;
+	}
+};
+void printPostorder(struct Node* node)
+{
+    if (node == NULL)
+        return;
+   
+    printPostorder(node->left);
+    printPostorder(node->right);
+    cout << node->data << " ";
+}
+ 
+
+int main()
+{
+	struct Node* root = new Node(1);
+	root->left = new Node(2);
+	root->right = new Node(3);
+	root->left->left = new Node(4);
+	root->left->right = new Node(5);
+
+	cout << "\nPreorder traversal of binary tree is \n";
+	printPostorder(root);
+
+	return 0;
+}
+