validate-binary-search-tree 1.0.0
Validate Binary Search Tree
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 40 of file main.cpp.

41{
42 if (root == nullptr)
43 return;
44 delete_tree(root->left);
45 delete_tree(root->right);
46 delete root;
47}
void delete_tree(TreeNode *root)
Definition main.cpp:40
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 49 of file main.cpp.

50{
51 // TreeNode* root = new TreeNode(5, new TreeNode(1), new TreeNode(4, new TreeNode(3), new TreeNode(6)));
52 // TreeNode* root = new TreeNode(5, new TreeNode(1), new TreeNode(6, new TreeNode(3), new TreeNode(7)));
53 // TreeNode* root = new TreeNode(2, new TreeNode(1), new TreeNode(3));
54 TreeNode* root = new TreeNode(5, new TreeNode(4), new TreeNode(6, new TreeNode(3), new TreeNode(7)));
55 Solution sol;
56 cout << "output: " << sol.isValidBST(root) << endl;
57 delete_tree(root);
58 return 0;
59}
bool isValidBST(TreeNode *root)
Definition main.cpp:24
Definition for a binary tree node.
Definition main.cpp:12

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