二叉树-非平衡

二叉树的插入和中序遍历的实现

#include "stdafx.h"
#include<stdlib.h>

struct BinanryTree
{
int value;
BinanryTree* p_left;
BinanryTree* p_right;
};

BinanryTree* insertTree(BinanryTree* p_tree, int value) {
if (p_tree == NULL) {
p_tree =(BinanryTree*) malloc(sizeof(BinanryTree));
p_tree->value = value;
p_tree->p_left = NULL;
p_tree->p_right = NULL;
return p_tree;
}
if (p_tree->value > value) {
p_tree->p_right=insertTree(p_tree->p_right, value);
}
else
{
p_tree-> p_left = insertTree(p_tree->p_left, value);
}
return p_tree;
}

/*对树中数据的操作*/
void operate(int value) {
printf("%d , ", value);
}

void showTree(BinanryTree* p_tree) {
if (p_tree == NULL) {
return;
}
/*调换下面三个顺序，实现前中后序遍历*/
showTree(p_tree->p_right);
operate(p_tree->value);
showTree(p_tree->p_left);

}

int main()
{
int x[8] = {54, 23, 12, 42, 90, 3, 132, 89};
BinanryTree* p_tree = NULL;

for (int i = 0; i < 8; i++) {
p_tree = insertTree(p_tree, x[i]);

}

showTree(p_tree);

return 0;
}