test/653.cpp at main · Alok-Singh-ops/test · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cctype>
#include<string>
#include<vector>
#include<list>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<algorithm>
#include<functional>
#include<unordered_map>

using namespace std;

#define ll long long
#define mod 1e9+7

struct TreeNode
{
  /* data */
  int val;
  struct TreeNode *left, *right;
  TreeNode(int data){
    this->val = data;
    this->left = NULL;
    this->right = NULL;
  };
};

void preOrder(TreeNode *root,vector<int> &temp){
  if (!root)
    return;
    temp.push_back(root->val);
    preOrder(root->left,temp);
    preOrder(root->right,temp);
}

bool findTarget(TreeNode* root, int k) {
  vector<int> temp;
  preOrder(root,temp);
  unordered_map<int,int> mp;
  for (int i = 0; i < temp.size(); i++)
  {
    if (mp.find(k-temp[i]) != mp.end())
      return true;
    else
      mp[temp[i]] = i;
  }

  for(auto it: mp)
    std::cout << it.first <<it.second <<std::endl;

  return false;
}


int main()
  {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    #ifndef ONLINE_JUDGE
      freopen("input.txt","r", stdin);
      freopen("output.txt","w", stdout);
    #endif//

    TreeNode* root = new TreeNode(5);
    root->left = new TreeNode(3);
    root->right = new TreeNode(6);
    root->left->left = new TreeNode(2);
    root->left->right = new TreeNode(4);
    root->right->right = new TreeNode(7);

    std::cout << findTarget(root,9) << std::endl;
    return 0;
}