backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-02-08 13:06:57 +08:00
Code Issues Projects Releases Wiki Activity

chore: use iwyu on data_structures/**.cpp

Browse Source
This commit is contained in:
realstealthninja
2024-09-13 15:37:49 +05:30
parent 24e597f7e2
commit a3b719e368
30 changed files with 602 additions and 634 deletions
Download Patch File Download Diff File Expand all files Collapse all files

54
data_structures/tree.cpp
View File

@@ -1,5 +1,7 @@
#include <iostream>
#include <list>
#include <cstddef> // for NULL
#include <iostream> // for operator<<, basic_ostream, char_traits, cout
#include <list> // for list
using namespace std;
struct node {
@@ -90,30 +92,30 @@ int main() {
cout << "\nEnter Your Choice : ";
cin >> ch;
switch (ch) {
case 1:
int x;
char pos;
cout << "\nEnter the value to be Inserted : ";
cin >> x;
cout << "\nLeft or Right of Root : ";
cin >> pos;
if (pos == 'l')
CreateTree(root, root->left, x, pos);
else if (pos == 'r')
CreateTree(root, root->right, x, pos);
break;
case 2:
BFT(root);
break;
case 3:
Pre(root);
break;
case 4:
In(root);
break;
case 5:
Post(root);
break;
case 1:
int x;
char pos;
cout << "\nEnter the value to be Inserted : ";
cin >> x;
cout << "\nLeft or Right of Root : ";
cin >> pos;
if (pos == 'l')
CreateTree(root, root->left, x, pos);
else if (pos == 'r')
CreateTree(root, root->right, x, pos);
break;
case 2:
BFT(root);
break;
case 3:
Pre(root);
break;
case 4:
In(root);
break;
case 5:
Post(root);
break;
}
} while (ch != 0);
}