backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-02-08 04:59:21 +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

47
data_structures/binary_search_tree.cpp
View File

@@ -6,7 +6,8 @@
* \warning This program is a poor implementation - C style - and does not
* utilize any of the C++ STL features.
*/
#include <iostream>
#include <cstddef> // for NULL
#include <iostream> // for operator<<, basic_ostream, char_traits, cout
struct node {
int val;
@@ -145,28 +146,28 @@ int main() {
std::cin >> ch;
int x;
switch (ch) {
case 1:
std::cout << "\nEnter the value to be Inserted : ";
std::cin >> x;
Insert(root, x);
break;
case 2:
std::cout << "\nEnter the value to be Deleted : ";
std::cin >> x;
Remove(root, root, x);
break;
case 3:
BFT(root);
break;
case 4:
Pre(root);
break;
case 5:
In(root);
break;
case 6:
Post(root);
break;
case 1:
std::cout << "\nEnter the value to be Inserted : ";
std::cin >> x;
Insert(root, x);
break;
case 2:
std::cout << "\nEnter the value to be Deleted : ";
std::cin >> x;
Remove(root, root, x);
break;
case 3:
BFT(root);
break;
case 4:
Pre(root);
break;
case 5:
In(root);
break;
case 6:
Post(root);
break;
}
} while (ch != 0);