Compilare: main.cpp: In member function 'void Btree::insert_not_full(Node*, long long int)': main.cpp:103:48: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long int' [-Wsign-compare] 103 | if (node->children[i + 1]->keys.size() == (2 * (long)this->t - 1)) /// if the selected child is full we split it | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Btree::insert(long long int)': main.cpp:117:31: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long int' [-Wsign-compare] 117 | if (old_root->keys.size() == ((2 * (long)this->t) - 1)) | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Btree::printTree(Node*, int)': main.cpp:135:24: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 135 | for (long i = 0; i < node->keys.size(); i++) | ~~^~~~~~~~~~~~~~~~~~~ main.cpp:140:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Node*>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 140 | for (int i=0;i<node->children.size();i++) | ~^~~~~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'bool Btree::find(long int)': main.cpp:177:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 177 | while (i < node->keys.size() && k > node->keys[i]) | ~~^~~~~~~~~~~~~~~~~~~ main.cpp:177:9: warning: this 'while' clause does not guard... [-Wmisleading-indentation] 177 | while (i < node->keys.size() && k > node->keys[i]) | ^~~~~ main.cpp:179:13: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while' 179 | cout<<"?"; | ^~~~ main.cpp:180:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 180 | if (i < node->keys.size() && node->keys[i] == k) | ~~^~~~~~~~~~~~~~~~~~~ main.cpp:188:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 188 | while (i < node->keys.size() && k > node->keys[i]) | ~~^~~~~~~~~~~~~~~~~~~ main.cpp:191:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 191 | if (i < node->keys.size() && node->keys[i] == k) | ~~^~~~~~~~~~~~~~~~~~~ main.cpp: In member function 'void Btree::deleteKey(Node*, long long int)': main.cpp:199:14: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 199 | while (i < node->keys.size() && k > node->keys[i]) | ~~^~~~~~~~~~~~~~~~~~~ main.cpp:203:15: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 203 | if (i < node->keys.size() && node->keys[i] == k) | ~~^~~~~~~~~~~~~~~~~~~ main.cpp:211:11: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 211 | if (i < node->keys.size() && node->keys[i] == k) | ~~^~~~~~~~~~~~~~~~~~~ main.cpp:214:45: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long int' [-Wsign-compare] 214 | else if (node->children[i]->keys.size() >= t) | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~ main.cpp:220:29: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<Node*>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 220 | if (i != 0 && i + 2 < node->children.size()) | ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~