binary-tree-level-order-traversal 1.0.0
Binary Tree Level Order Traversal
Loading...
Searching...
No Matches
main.cpp File Reference
#include <iostream>
#include <vector>
#include <queue>
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 51 of file main.cpp.

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

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

Referenced by delete_tree(), and main().

◆ main()

int main ( )

Definition at line 60 of file main.cpp.

61{
62 TreeNode* root = new TreeNode(3, new TreeNode(9), new TreeNode(20, new TreeNode(15), new TreeNode(7)));
63 Solution sol;
64 vector<vector<int>> answer = sol.levelOrder(root);
65 for (vector<int>& array: answer)
66 {
67 for (int el: array)
68 cout << el << " ";
69 cout << endl;
70 }
71 delete_tree(root);
72 return 0;
73}
vector< vector< int > > levelOrder(TreeNode *root)
Definition main.cpp:22
Definition for a binary tree node.
Definition main.cpp:10

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