Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
47 lines (37 loc) · 707 Bytes

File metadata and controls

47 lines (37 loc) · 707 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
#ifndef __BINARY_TREE_HPP__
#define __BINARY_TREE_HPP__
#include <iostream>
#include <vector>
#include <cstdint>
namespace cppcode { namespace common { namespace binary_tree {
template <typename T>
struct Node
{
Node(T value, Node<T>* l, Node<T>* r)
: value{std::move(value)}
, left{l}
, right{r}
{}
T value;
Node<T>* left;
Node<T>* right;
};
template <typename T, typename V>
void preorder(const Node<T>* node, const V& visit)
{
if (nullptr == node)
{
return;
}
visit(node);
if (node->left)
{
preorder(node->left, visit);
}
if (node->right)
{
preorder(node->right, visit);
}
}
}}}
#endif
Morty Proxy This is a proxified and sanitized view of the page, visit original site.