maximum-level-sum-of-a-binary-tree 1.0.0
Maximum Level Sum of a Binary Tree
Loading...
Searching...
No Matches
main.cpp File Reference
#include <iostream>
#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 70 of file main.cpp.

71{
72 if (root == nullptr)
73 return;
74 delete_tree(root->left);
75 delete_tree(root->right);
76 delete root;
77}
void delete_tree(TreeNode *root)
Definition main.cpp:70
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 79 of file main.cpp.

80{
81 TreeNode* root = new TreeNode(1, new TreeNode(7, new TreeNode(7), new TreeNode(-8)), new TreeNode(0));
82 Solution sol;
83 cout << "output: " << sol.maxLevelSum(root) << endl;
84 delete_tree(root);
85 return 0;
86}
int maxLevelSum(TreeNode *root)
Definition main.cpp:22
Definition for a binary tree node.
Definition main.cpp:10

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