binary-search-tree-iterator 1.0.0
Binary Search Tree Iterator
Loading...
Searching...
No Matches
main.cpp File Reference
#include <iostream>
#include <vector>
#include <stack>
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  BSTIterator
 

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:13
TreeNode * right
Definition main.cpp:14

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(7, new TreeNode(3), new TreeNode(15, new TreeNode(9), new TreeNode(20)));
82 BSTIterator* obj = new BSTIterator(root);
83
84 int param_1 = obj->next();
85 cout << param_1 << " ";
86
87 param_1 = obj->next();
88 cout << param_1 << " ";
89
90 bool param_2 = obj->hasNext();
91 cout << param_2 << " ";
92
93 param_1 = obj->next();
94 cout << param_1 << " ";
95
96 param_2 = obj->hasNext();
97 cout << param_2 << " ";
98
99 param_1 = obj->next();
100 cout << param_1 << " ";
101
102 param_2 = obj->hasNext();
103 cout << param_2 << " ";
104
105 param_1 = obj->next();
106 cout << param_1 << " ";
107
108 param_2 = obj->hasNext();
109 cout << param_2 << endl;
110
111 delete_tree(root);
112 delete(obj);
113 return 0;
114}
bool hasNext()
Definition main.cpp:64
int next()
Definition main.cpp:52
Definition for a binary tree node.
Definition main.cpp:11

References delete_tree(), BSTIterator::hasNext(), and BSTIterator::next().