-
Notifications
You must be signed in to change notification settings - Fork 0
/
binary_tree.cpp
47 lines (40 loc) · 1.1 KB
/
binary_tree.cpp
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
#include <cstddef>
#include <iostream>
#include <random>
#include <bits/stdc++.h>
using namespace std;
class BinaryTreeNode {
public:
int data;
BinaryTreeNode* left;
BinaryTreeNode* right;
BinaryTreeNode(int _data): data(_data), left(nullptr), right(nullptr) {}
friend std::ostream& operator<<(std::ostream& os, const BinaryTreeNode* root) {
os << root->data << endl;
os << "/\\" << endl;
if (root->left != nullptr) os << root->left;
if (root->right != nullptr) os << root->right;
return os;
}
};
std::ostream& operator<<(std::ostream& os, const BinaryTreeNode* root) {
os << root->data << endl;
os << "/\\" << endl;
if (root->left != nullptr) os << root->left;
if (root->right != nullptr) os << root->right;
return os;
}
BinaryTreeNode* buildtree(int d) {
BinaryTreeNode* root;
if(d==-1){
return NULL;
}
root=new BinaryTreeNode(rand()%100);
root->left=buildtree(d-1);
root->right=buildtree(d-1);
return root;
}
int main() {
BinaryTreeNode* root = buildtree(10);
cout << root;
}