Repository navigation
Expand file tree
/
Copy pathbalanced_binary_tree.cpp
More file actions
259 lines (194 loc) · 4.82 KB
/
Copy pathbalanced_binary_tree.cpp
File metadata and controls
259 lines (194 loc) · 4.82 KB
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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
// Copyright (c) Omar Boukli-Hacene. All rights reserved.
// Distributed under an MIT-style license that can be
// found in the LICENSE file.
// SPDX-License-Identifier: MIT
#include "forfun/graph/balanced_binary_tree.hpp"
#include <algorithm>
#include <cstddef>
#include <cstdlib>
#include <utility>
#include "forfun/graph/binary_tree_node.hpp"
namespace forfun::graph::balanced_binary_tree {
namespace raw {
namespace {
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Wnrvo"
#endif // __clang__
auto measure_depth_internal(binary_tree_node const* const root) noexcept
-> std::ptrdiff_t
{
if (root == nullptr)
{
return 0;
}
auto const left{measure_depth_internal(root->left_node_)};
if (left == std::ptrdiff_t{-1})
{
return -1;
}
auto const right{measure_depth_internal(root->right_node_)};
if (right == std::ptrdiff_t{-1})
{
return -1;
}
// NOLINTNEXTLINE(cppcoreguidelines-init-variables)
std::ptrdiff_t min /*[[indeterminate]]*/;
// NOLINTNEXTLINE(cppcoreguidelines-init-variables)
std::ptrdiff_t max /*[[indeterminate]]*/;
if (left < right)
{
min = left;
max = right;
}
else
{
min = right;
max = left;
}
if ((max - min) > std::ptrdiff_t{1})
{
return -1;
}
return ++max;
}
#ifdef __clang__
#pragma clang diagnostic pop
#endif // __clang__
} // namespace
[[nodiscard]] auto is_balanced(binary_tree_node const* const root) noexcept
-> bool
{
return measure_depth_internal(root) != std::ptrdiff_t{-1};
}
} // namespace raw
namespace stl_abs {
namespace {
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Wnrvo"
#endif // __clang__
auto is_unbalanced_internal(binary_tree_node const* const root) noexcept
-> std::pair<std::size_t, bool>
{
if (root == nullptr)
{
return {0UZ, false};
}
auto const left{is_unbalanced_internal(root->left_node_)};
if (left.second)
{
return left;
}
auto const right{is_unbalanced_internal(root->right_node_)};
if (right.second)
{
return right;
}
auto const diff{std::abs(
static_cast<std::ptrdiff_t>(left.first)
- static_cast<std::ptrdiff_t>(right.first)
)};
if (diff > decltype(diff){1})
{
return {{}, true};
}
return {std::max(left.first, right.first) + 1UZ, false};
}
#ifdef __clang__
#pragma clang diagnostic pop
#endif // __clang__
} // namespace
[[nodiscard]] auto is_balanced(binary_tree_node const* const root) noexcept
-> bool
{
return not is_unbalanced_internal(root).second;
}
} // namespace stl_abs
namespace stl_minmax {
namespace {
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Wnrvo"
#endif // __clang__
auto is_unbalanced_internal(binary_tree_node const* const root) noexcept
-> std::pair<std::size_t, bool>
{
if (root == nullptr)
{
return {0UZ, false};
}
auto const left{is_unbalanced_internal(root->left_node_)};
if (left.second)
{
return left;
}
auto const right{is_unbalanced_internal(root->right_node_)};
if (right.second)
{
return right;
}
auto const [min, max]{std::minmax(left.first, right.first)};
if (std::size_t const diff{max - min}; diff > 1UZ)
{
return {{}, true};
}
return {max + 1UZ, false};
}
#ifdef __clang__
#pragma clang diagnostic pop
#endif // __clang__
} // namespace
[[nodiscard]] auto is_balanced(binary_tree_node const* const root) noexcept
-> bool
{
return not is_unbalanced_internal(root).second;
}
} // namespace stl_minmax
namespace stl_pair {
namespace {
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Wnrvo"
#endif // __clang__
auto is_unbalanced_internal(binary_tree_node const* const root) noexcept
-> std::pair<std::size_t, bool>
{
if (root == nullptr)
{
return {0UZ, false};
}
auto const left{is_unbalanced_internal(root->left_node_)};
if (left.second)
{
return left;
}
auto const right{is_unbalanced_internal(root->right_node_)};
if (right.second)
{
return right;
}
// clang-format off
auto const diff{
left.first > right.first
? left.first - right.first
: right.first - left.first
};
// clang-format on
if (diff > 1UZ)
{
return {{}, true};
}
return {std::max(left.first, right.first) + 1UZ, false};
}
#ifdef __clang__
#pragma clang diagnostic pop
#endif // __clang__
} // namespace
[[nodiscard]] auto is_balanced(binary_tree_node const* const root) noexcept
-> bool
{
return not is_unbalanced_internal(root).second;
}
} // namespace stl_pair
} // namespace forfun::graph::balanced_binary_tree