binary-tree-preorder-traversal 1.0.0
Binary Tree Preorder 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 62 of file main.cpp.

63{
64 if (root == nullptr)
65 return;
66 delete_tree(root->left);
67 delete_tree(root->right);
68 delete root;
69}
void delete_tree(TreeNode *root)
Definition main.cpp:62
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 71 of file main.cpp.

72{
73 TreeNode* root = new TreeNode(1, NULL, new TreeNode(2, new TreeNode(3, NULL, NULL), NULL));
74 Solution sol;
75 vector<int> preorder = sol.preorderTraversal(root);
76 for (int el: preorder)
77 cout << el << ", ";
78 cout << endl;
79 delete_tree(root);
80 return 0;
81}
vector< int > preorderTraversal(TreeNode *root)
Definition main.cpp:38
Definition for a binary tree node.
Definition main.cpp:12

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