bin-trees/tree.h


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

#pragma once
#include <iostream>
#include <queue>
#include <cmath>

using namespace std;

struct tree
{
    int inf;
    tree *left;
    tree *right;
    tree *parent;
};

tree *node(int x)
{
    tree *n = new tree;
    n->inf = x;
    n->parent = NULL;
    n->right = NULL;
    n->left = NULL;
    return n;
}

void find(tree *&tr, int x, tree *&res)
{
    if (tr)
    {
        if (tr->inf == x)
        {
            res = tr;
        }
        else
        {
            find(tr->left, x, res);
            find(tr->right, x, res);
        }
    }
}

void print(tree *tr, int k)
{
    if (!tr) cout << "Empty tree" << endl;
    else
    {
        queue<tree*> cur, next;
        tree *r = tr;
        cur.push(r);
        int j = 0;
        while (cur.size())
        {
            if (j == 0)
            {
                for (int i = 0; i < (int) pow(2.0, k) - 1; i++)
                    cout << ' ';
            }
            tree *buf = cur.front();
            cur.pop();
            j++;
            if (buf)
            {
                cout << buf->inf;
                next.push(buf->left);
                next.push(buf->right);
                for (int i = 0; i < (int) pow(2.0, k + 1) - 1; i++)
                    cout << ' ';
            }
            if (!buf)
            {
                for (int i = 0; i < (int) pow(2.0, k + 1) - 1; i++)
                    cout << ' ';
                cout << ' ';
            }
            if (cur.empty())
            {
                cout << endl;
                swap(cur, next);
                j = 0;
                k--;
            }
        }
    }
}