binary-tree-postorder-traversal 1.0.0
Binary Tree Postorder Traversal
Loading...
Searching...
No Matches
main.cpp File Reference
#include <iostream>
#include <vector>
#include <stack>
#include <algorithm>
Include dependency graph for main.cpp:

Go to the source code of this file.

Data Structures

struct  TreeNode
 Definition for a binary tree node. More...
 
class  Solution
 

Functions

void delete_tree (TreeNode *root)
 
int main ()
 

Function Documentation

◆ delete_tree()

void delete_tree ( TreeNode root)

Definition at line 52 of file main.cpp.

53{
54 if (root == nullptr)
55 return;
56 delete_tree(root->left);
57 delete_tree(root->right);
58 delete root;
59}
void delete_tree(TreeNode *root)
Definition main.cpp:52
TreeNode * left
Definition main.cpp:14
TreeNode * right
Definition main.cpp:15

References delete_tree(), TreeNode::left, and TreeNode::right.

Referenced by delete_tree(), and main().

◆ main()

int main ( )

Definition at line 61 of file main.cpp.

62{
63 TreeNode* root = new TreeNode(1, new TreeNode(2, new TreeNode(4), new TreeNode(5, new TreeNode(6), new TreeNode(7))), new TreeNode(3, NULL, new TreeNode(8, new TreeNode(9), NULL)));
64 Solution sol;
65 vector<int> preorder = sol.postorderTraversal(root);
66 for (int el: preorder)
67 cout << el << ", ";
68 cout << endl;
69 delete_tree(root);
70 return 0;
71}
vector< int > postorderTraversal(TreeNode *root)
Definition main.cpp:24
Definition for a binary tree node.
Definition main.cpp:12

References delete_tree(), and Solution::postorderTraversal().