Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "bits/stdc++.h"
- using namespace std;
- namespace lab3{
- struct TreeNode {
- int val;
- TreeNode *left;
- TreeNode *right;
- TreeNode() : val(0), left(nullptr), right(nullptr) {}
- TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
- TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
- };
- void Add(TreeNode *&tree, int x){
- if(tree == nullptr)
- tree = new TreeNode(x);
- else{
- if(tree->val > x){
- if(tree->left != nullptr)
- Add(tree->left, x);
- else{
- tree->left = new TreeNode(x);
- }
- }
- if(tree->val < x){
- if(tree->right != nullptr)
- Add(tree->right, x);
- else{
- tree->right = new TreeNode(x);
- }
- }
- }
- }
- }
- #ifndef ALGORITHMS_LAB3_H
- #define ALGORITHMS_LAB3_H
- #endif //ALGORITHMS_LAB3_H
Add Comment
Please, Sign In to add comment