github/Node_common_in_both_trees.cpp at main · Pallavi960/github · 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
#include<iostream>
#include<stack>
#include<vector>
#include<algorithm>
using namespace std;

struct Node{
    int data;
    Node* right;
    Node* left;
    Node(int val)
    {

        data=val;
        left=right=NULL;
    }
};


void traversar(Node* root,vector<int>&node)
{
    if(root==NULL);
    node.push_back(root->data);
    if(root->left!=NULL)traversar(root->left,node);
    if(root->right!=NULL)traversar(root->right,node);
}


void get(Node* root,vector<int>&node,vector<int>&ans)
{
    if(root==NULL);
    auto it=std::find(node.begin(),node.end(),node.data);
    if(it=ans.end())ans.push_back(root->data);
    if(root->left!=NULL)traversar(root->left,node);
    if(root->right!=NULL)traversar(root->right,node);
}


int main()
{
    //tree 1
    Node * root=new Node(1);//

    root->left=new Node(2);
    root->left->right=new Node(3);
    root->left->left=new Node(4);

    root->right=new Node(5);
    root->right->left=new Node(6);
    root->right->right=new Node(7);


    //tree 2
    Node* root2=new Node(1);

    root2->left=new Node(2);
    root2->right=new Node(3);

    root2->left->right=new Node(4);
    root2->left->left=new Node(5);
    root2->right->left=new Node(6);

    vector<int>nums;
    traversar(root,nums);

    get(root2,nums)
}