DSAcodes/BinarySearchTreePaths1.cpp at master · ankit-songara/DSAcodes · 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
#include<bits/stdc++.h>
using namespace std;

struct bstnode
{
    bstnode *lc;
    int data;
    bstnode *rc;
};

typedef bstnode *BSTPTR;

void insert(BSTPTR &T, int k)
{
    if (T == NULL)
    {
        T = new (bstnode);
        T->data = k;
        T->lc = NULL;
        T->rc = NULL;
    }
    else
    {
        if (k < T->data)
        {
            insert(T->lc, k);
        }
        else
        {
            insert(T->rc, k);
        }
    }
}
int pathArr[50];
void path(BSTPTR T, int i)
{
    if(T==NULL)
    {
        return;
    }
    pathArr[i]=T->data;
    i++;

    if(T->lc==NULL && T->rc==NULL)
    {
        for(int j=0;j<i;j++)
        {
            cout<<pathArr[j]<<" ";
        }
        cout<<endl;
    }
    else
    {
        path(T->lc,i);
        path(T->rc,i);
    }

}

int main()
{
    BSTPTR T2;
    T2 = NULL;
    int i=0;
    int n;
    while (n != -1)
    {
        cin >> n;
        if (n == -1)
            break;
        insert(T2, n);
    }
    path(T2, 0);
}