Scribd
Upload
12 views2 pages

Post Order Binary Tree

The document contains C++ code that defines a binary tree using a TreeNode structure. It includes a function for printing the tree elements in a pre-order traversal manner. The main function creates a simple binary tree and calls the print function to display its elements.

Uploaded by

johnnystar91a
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views2 pages

Post Order Binary Tree

The document contains C++ code that defines a binary tree using a TreeNode structure. It includes a function for printing the tree elements in a pre-order traversal manner. The main function creates a simple binary tree and calls the print function to display its elements.

Uploaded by

johnnystar91a
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

#include<bits/stdc++.

h>

using namespace std;

//structure to define a node in the binary tree

struct TreeNode {

int value;

struct TreeNode* left;

struct TreeNode* right;

TreeNode(int val) { //constructor to initialize the node with a value

value = val;

left = NULL;

right = NULL;

};

//function to print the binary tree elements using in-order traversal

void printBinaryTree(struct TreeNode* root) {

if (root == NULL) {

return;

// Print the value of the present node

cout << root->value << " ";

// Traverse the left subtree

printBinaryTree(root->left);

// Traverse the right subtree

printBinaryTree(root->right);

}
int main() {

struct TreeNode* root = new TreeNode(1); // Create the root of the binary tree

// Create left and right child nodes

root->left = new TreeNode(2);

root->right = new TreeNode(3);

// Create a left child for the root's left node

root->left->left = new TreeNode(4);

// Print the binary tree elements using Post-order traversal

printBinaryTree(root);

return 0;

You might also like