#include <stdint.h>
#include <stdlib.h>
#include <stdio.h>
#include <inttypes.h>
#include <string>
#include <string.h>
#include <sstream>
#include <memory>
#include <map>
#include <unordered_map>
#include <list>
#include <vector>
#include <set>
#include <deque>
#include <sys/time.h>
#include <unistd.h>
#include <sys/timeb.h>
#include <thread>
#include <iostream>
//g++ -g -Wl,-as-needed -std=c++11 -o tree tree.cpp -lpthread
typedef struct _Node{
int m = 0;
struct _Node* lc = nullptr;
struct _Node* rc = nullptr;
struct _Node* parent = nullptr;
}Node;
Node* create_node(int m, Node* parent){
Node* node = new Node;
node->m = m;
node->parent = parent;
return node;
}
void insert(int m, Node* root){
Node* cur = root;
while(1){
Node* parent = cur;
if(m >= cur->m){
if(cur->rc == nullptr){
printf("%d's rchild:%d\n", cur->m, m);
cur->rc = create_node(m, parent);
return;
}
cur = cur->rc;
}
else{
if(cur->lc== nullptr){
printf("%d's lchild:%d\n", cur->m, m);
cur->lc = create_node(m, parent);
return;
}
cur = cur->lc;
}
}
}
Node* create_tree(int data[], int n){
printf("data[] size:%d\n", n);
if(n < 1){
return nullptr;
}
Node* tree = create_node(data[0], nullptr);
int i = n-1;
while(--i > 0){
printf("insert data[%d]=%d\n", i, data[i]);
insert(data[i], tree);
}
return tree;
}
void left_deep_walk(Node* root)//中序遍历
{
std::vector<Node*> walk_nodes;
walk_nodes.push_back(root);
Node* cur = root;
if(cur == nullptr){
return;
}
while (!walk_nodes.empty())
{
if(cur == nullptr){
cur = walk_nodes.back();
printf("%d\n", cur->m);
walk_nodes.pop_back();
if(cur->rc == nullptr){
cur = nullptr;
}
else{
cur = cur->rc;
walk_nodes.push_back(cur);
}
continue;
}
if(cur->lc == nullptr)
{
printf("%d\n", cur->m);
walk_nodes.pop_back();
if(cur->rc == nullptr){
cur = nullptr;
}
else{
cur = cur->rc;
walk_nodes.push_back(cur);
}
}
else{
cur = cur->lc;
walk_nodes.push_back(cur);
}
}
}
int main()
{
int data[] = {12,34,67,8,12,9842,789,23,978,3,10000,234,56,78,243,423,34,243,43,6785,312,1};
Node* tree = create_tree(data, sizeof(data)/sizeof(int));
left_deep_walk(tree);
return 0;
}
输出结果
root@ubuntu:/home/guohua/test# g++ -g -Wl,-as-needed -std=c++11 -o tree tree.cpp -lpthread
root@ubuntu:/home/guohua/test# ./tree
data[] size:22
insert data[20]=312
12's rchild:312
insert data[19]=6785
312's rchild:6785
insert data[18]=43
312's lchild:43
insert data[17]=243
43's rchild:243
insert data[16]=34
43's lchild:34
insert data[15]=423
6785's lchild:423
insert data[14]=243
243's rchild:243
insert data[13]=78
243's lchild:78
insert data[12]=56
78's lchild:56
insert data[11]=234
78's rchild:234
insert data[10]=10000
6785's rchild:10000
insert data[9]=3
12's lchild:3
insert data[8]=978
423's rchild:978
insert data[7]=23
34's lchild:23
insert data[6]=789
978's lchild:789
insert data[5]=9842
10000's lchild:9842
insert data[4]=12
23's lchild:12
insert data[3]=8
3's rchild:8
insert data[2]=67
56's rchild:67
insert data[1]=34
34's rchild:34
3
8
12
12
23
34
34
43
56
67
78
234
243
243
312
423
789
978
6785
9842
10000