Skip to content

add:PostorderTraversal #7

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
rachit-geek wants to merge 2 commits into
base: main
Choose a base branch
from
Open

add:PostorderTraversal #7

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
b6ea406
add:PostorderTraversal
rachit-geek Oct 2, 2021
df9e2e5
Update PostorderTraversal.cpp
rachit-geek Oct 2, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
38 changes: 38 additions & 0 deletions PostorderTraversal.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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;
}