insert_order.c

二叉数插入排序,及删除算法

#include "head.h"
JD *insert_order(JD *tree, int data)
{
	JD  *p;
	JD  *q;
	JD  *temp;
	temp = (JD*)malloc(sizeof(JD));
	temp->data = data;
	temp->left = NULL;
	temp->right = NULL;
	if(tree == NULL)
	{
		return temp;
	}
	else
	{
		p = tree;
		while(p != NULL)
		{
			q = p;
			if(p->data > data)
			{
				p = p->left;
			}
			else
			{
				p = p->right;
			}
		}
		if(q->data > data)
		{
			q->left = temp;
		}
		else
		{
			q->right = temp;
		}

		return tree;
	}

}