data-structure-cpp-implemenation/pre,in,post order.cpp at master · muhammadtarek98/data-structure-cpp-implemenation · 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
81
82
83
84
85
86
87
88
89
90
91
#include<bits/stdc++.h>
#define format(q) setpersesion(q)
using namespace std;
struct node{
  int item;
  node *left,*right;
};
// depth first traversal
void preorder(node *pl)///root left right
{
  if(pl!=NULL)
  {
    cout<<pl->item<<"->";
    preorder(pl->left);
    preorder(pl->right);
  }
}
void inorder(node *pl)///left root right
{
  if(pl!=NULL)
  {
    inorder(pl->left);
    cout<<pl->item<<"->";
    inorder(pl->right);
  }
}
void postorder(node *pl) /// left right root
{
  if(pl!=NULL)
  {
    postorder(pl->left);
    postorder(pl->right);
    cout<<pl->item<<"->";
  }
}
void preorder_right(node *pr)///root right left
{
  if(pr!=NULL)
  {
    cout<<pr->item<<"->";
    preorder_right(pr->right);
    preorder_right(pr->left);
  }
}
void inorder_right(node *pr)///right root left
{
  if(pr!=NULL)
  {
    inorder_right(pr->right);
    cout<<pr->item<<"->";
    inorder_right(pr->left);
  }
}
void postorder_right(node *pr) /// right left root
{
  if(pr!=NULL)
  {
    postorder_right(pr->right);
    postorder_right(pr->left);
    cout<<pr->item<<"->";
  }
}
//breadth first traversal
void levelorder(node *p)
{
    if(p==NULL)
    {
      return;
    }
    queue<node*>q;
    q.push(p);
    while (!q.empty())
    {
      node *f=q.front();
      cout<<f->item<<"->";
      if(f->left!=NULL)
      {
        q.push(f->left);
      }
      if(f->right!=NULL)
      {
        q.push(f->right);
      }
      q.pop();
    }
}
int main()
{
    ///fast();
    return 0;
}