cppAlgorithms/Trees1.cpp at main · RozForCode/cppAlgorithms · 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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
// // making a simple tree
struct TreeNode
{
    int data;
    TreeNode *right;
    TreeNode *left;
    TreeNode(int value)
    {
        this->data = value;
        this->left = nullptr;
        this->right = nullptr;
        /*
        other way to initialize
        data(value)
        left(nullptr)
        right(nullptr)
        */
    }
};

// // lets make a print function to print this tree beautifully
#include <iostream>
#include <vector>
#include <cmath>
#include <string>
#include <iomanip>
#include <algorithm>
#include <queue>
// // The #include <iomanip> header in C++ gives you access to "input/output manipulators" — these
// // are tools that help you format text and numbers when printing to the console (or reading input).
using namespace std;
// // recursive method to get the height of the tree
// int getHeight(TreeNode *root)
// {
//     if (!root)
//         return 0;
//     return 1 + max(getHeight(root->right), getHeight(root->left));
// }
// void printTree(TreeNode *root)
// {
//     if (!root)
//         return;
//     int maxLevel = getHeight(root);
//     int maxWidth = pow(2, maxLevel) * 2;
//     queue<TreeNode *> q;
//     q.push(root);

//     for (int level = 1; level <= maxLevel; level++)
//     {
//         int levelNodes = pow(2, level - 1);
//         int spacing = maxWidth / levelNodes;
//         for (int i = 0; i < levelNodes; i++)
//         {
//             TreeNode *curr = q.front();
//             q.pop();
//             if (curr)
//                 cout << setw(spacing) << curr->data;
//             else
//                 cout << setw(spacing) << " ";
//             if (curr)
//             {
//                 q.push(curr->left);
//                 q.push(curr->right);
//             }
//             else
//             {
//                 q.push(nullptr);
//                 q.push(nullptr);
//             }
//         }
//         cout << endl;
//         if (level != maxLevel)
//         {
//             for (int j = 0; j < levelNodes; j++)
//             {
//                 cout << setw(spacing / 2) << ((j % 2 == 0) ? "/" : "\\");

//                 cout << setw(spacing / 2) << " ";
//             }
//             cout << endl;
//         }
//     }
// }
void printTree(TreeNode *root, int space = 0, int indent = 5)
{
    if (!root)
        return;

    space += indent;

    // Print right child first (so it's on top in output)
    printTree(root->right, space);

    // Print current node after space
    cout << endl;
    for (int i = indent; i < space; ++i)
        cout << ' ';
    cout << root->data << "\n";

    // Print left child
    printTree(root->left, space);
}

int main()
{
    TreeNode *root = new TreeNode(10);
    root->left = new TreeNode(9);
    root->right = new TreeNode(8);
    root->right->left = new TreeNode(7);
    root->right->right = new TreeNode(6);
    printTree(root);
    return 0;
}