超详细最全数据结构个人笔记【平衡二叉树】

1.平衡二叉树概述

​ 平衡二叉树又称AVL树，它或者是一棵空树，或者是具有以下特性的二叉排序树（BST）

(1) 它的左子树或者右子树都是平衡二叉树

(2) 左子树和右子树的深度之差的绝对值不超过1(1,-0,-1)

若将二叉树上的节点的平衡因子定义为该节点的左子树的深度减去它右子树的深度，所以平衡二叉树所有节点的平衡因子只可能是-1，0，1

只有二叉树上有一个节点的平衡因子的绝对值大于1，则该二叉树不平衡。

2.建立平衡二叉树

​ 建立平衡二叉树过程中，把不平衡的树转为平衡树的四种方式：

​ (1)单向右旋平衡处理 SingleRotateWithRight

​

(2)单向左旋平衡处理，SingleRotateWithLeft

(3)双向旋转(先左后右)平衡处理 DoubleRotateLeftRight

(4)双向旋转(先右后左)平衡处理DoubleRotateRightLeft

实现代码：

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>

#define MAX_NODE(a,b) ((a) > (b) ? (a) : (b))

typedef char dataType;

typedef struct AVLNode
{
    dataType data;
    struct AVLNode *lchild, *rchild;
    int height; // 树的高度，高度大于1需要旋转
}AVLNode;

#define NODE AVLNode
#include "drawtree.h"

// 返回每个节点的高度
int Height(AVLNode *root)
{
    if(root == NULL)
        return 0;

    return root->height;
}

// 单向右旋
AVLNode *SingleRotateWithRight(AVLNode *k2)
{
    AVLNode *k1 = k2->lchild;
    k2->lchild = k1->rchild;
    k1->rchild = k2;
    // 更新K1，k2高度
    k2->height = MAX_NODE(Height(k2->lchild),Height(k2->rchild))+1;
    k1->height = MAX_NODE(Height(k1->lchild),Height(k1->rchild))+1;
    return k1;
}

// 单向左旋
AVLNode *SingleRotateWithLeft(AVLNode *k2)
{
    AVLNode *k1 = k2->rchild;
    k2->rchild = k1->lchild;
    k1->lchild = k2;
    // 更新K1，k2高度
    k2->height = MAX_NODE(Height(k2->lchild),Height(k2->rchild))+1;
    k1->height = MAX_NODE(Height(k1->lchild),Height(k1->rchild))+1;
    return k1;
}

// 双向旋转，先左旋后右旋
AVLNode *DoubleRotateLeftRight(AVLNode *k3)
{
    k3->lchild = SingleRotateWithLeft(k3->lchild);
    return SingleRotateWithRight(k3);
}

// 双向旋转，先右旋后左旋
AVLNode *DoubleRotateRightLeft(AVLNode *k3)
{
    k3->rchild = SingleRotateWithRight(k3->rchild);
    return SingleRotateWithLeft(k3);
}

// 插入节点
AVLNode *insert_node(AVLNode *root, dataType data)
{
    if(root == NULL)// 从无到有
    {
        root = malloc(sizeof(AVLNode));
        if(root == NULL)
            return NULL;

        root->height = 1;
        root->data = data;
        root->lchild = NULL;
        root->rchild = NULL;
        return root;
    }

    if(data > root->data) // 节点插入到右子树
    {
        // 递归找位置
        root->rchild = insert_node(root->rchild,data);
        // 右子树高度加1
        root->height = MAX_NODE(Height(root->lchild),Height(root->rchild))+1;

        // 需要旋转
        if(Height(root->rchild) - Height(root->lchild) > 1)
        {
            if(data > root->rchild->data) // 右插
            {
                // 单向左旋
                root = SingleRotateWithLeft(root);
            }
            else // 左插
            {
                // 先右后左
                root = DoubleRotateRightLeft(root);
            }
        }
    }
    else if(data < root->data)
    {
        // 找位置
        root->lchild = insert_node(root->lchild, data);

        // 更新树的高度+1
        root->height = MAX_NODE(Height(root->lchild),Height(root->rchild))+1;

        if(Height(root->lchild) - Height(root->rchild) > 1)// 左深
        {
            if(data > root->lchild->data) // 右插
            {
                // 先左旋后右旋
                root = DoubleRotateLeftRight(root);
            }
            else if(data < root->lchild->data) // 左插
            {
                // 单向右旋
                root = SingleRotateWithRight(root);
            }
        }

    }

    return root;
}

int main(int argc, char const *argv[])
{
    AVLNode *root = NULL;
    while(1)
    {
        dataType data = getchar();
        if(data == '#')
            break;
        root = insert_node(root,data);
    }

    // 显示
    draw(root);

    return 0;
}

drawtree.h

///
//
//  Copyright(C), 2013-2017, GEC Tech. Co., Ltd.
//
//  文件: lab/tree/headers/drawtree.h
//  日期: 2017-9
//  描述: 使用C语言写一页webpage展示二叉树
//
///

#ifndef _DRAWTREE_H_
#define _DRAWTREE_H_

/* ↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓ 公共头文件 ↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓ */
#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
//#include <unistd.h>
#include <string.h>
//#include <strings.h>
#include <time.h>
#include <errno.h>

#include <sys/stat.h>
#include <sys/types.h>
#include <fcntl.h>

// #include <sys/ipc.h>
// #include <sys/sem.h>
// #include <sys/shm.h>
// #include <sys/msg.h>
// #include <semaphore.h>
#include <fcntl.h>

//#include <pthread.h>
/* ↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑ 公共头文件 ↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑ */

#define MAX(a, b) ({ \
		typeof(a) _a = a; \
		typeof(b) _b = b; \
		(void)(&_a == &_b);\
		_a > _b? _a : _b; \
		})


/* ↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓ 默认二叉树节点 ↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓ */
typedef struct _tree_node
{
	int data;
	struct _tree_node *lchild;
	struct _tree_node *rchild;

#ifdef AVL
	int height;
#endif

#ifdef RB
	struct _tree_node *parent;
	int color;
#endif
}_treenode, *_linktree;
/* ↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑ 默认二叉树节点 ↑↑↑↑↑↑↑↑↑↑↑↑↑↑↑ */


/* ↓↓↓↓↓ 用户指定二叉树节点 ↓↓↓↓↓ */
#ifndef NODE
#define NODE _treenode
#endif
/* ↑↑↑↑↑ 用户指定二叉树节点 ↑↑↑↑↑ */



/* ↓↓↓↓↓↓↓↓↓↓↓↓↓ 画网页相关算法代码 ↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓ */

#ifndef QUEUE_NODE_DATATYPE
#define QUEUE_NODE_DATATYPE NODE *
#endif

typedef QUEUE_NODE_DATATYPE qn_datatype;

struct _queue_node
{
	qn_datatype data;
	struct _queue_node *next;

};

typedef struct
{
	struct _queue_node *front;
	struct _queue_node *rear;
#ifdef QUEUE_SIZE
	int size;
#endif
}_queuenode, *_linkqueue;


static _linkqueue init_queue(void)
{
    _linkqueue q = (_linkqueue)malloc(sizeof(_queuenode));
	q->front = q->rear =
		(struct _queue_node *)malloc(sizeof(struct _queue_node));
	q->rear->next = NULL;

	return q;
}

static bool is_empty_q(_linkqueue q)
{
	return (q->front == q->rear);
}

/* ↓↓↓↓↓↓↓↓↓↓↓↓↓ 画网页相关算法代码 ↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓ */
static bool out_queue(_linkqueue q, qn_datatype *pdata)
{
	if(is_empty_q(q))
		return false;

	struct _queue_node *p = q->front;

	q->front = q->front->next;
	free(p);
	*pdata = q->front->data;

	return true;
}

static bool en_queue(_linkqueue q, qn_datatype data)
{
	struct _queue_node *pnew;
	pnew = (struct _queue_node *)malloc(sizeof(struct _queue_node));
	if(pnew == NULL)
		return false;

	pnew->data = data;
	pnew->next = NULL;

	q->rear->next = pnew;
	q->rear = pnew;

	return true;
}

#ifdef QUEUE_SIZE
int queue_size(_linkqueue *q)
{
	return q->size;
}
#endif
/* ↓↓↓↓↓↓↓↓↓↓↓↓↓ 画网页相关算法代码 ↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓ */


static void pre_travel(NODE *root, void (*handler)(NODE *))
{
	if(root == NULL)
		return;
	
	handler(root);
	pre_travel(root->lchild, handler);
	pre_travel(root->rchild, handler);
}

static void mid_travel(NODE *root, void (*handler)(NODE *))
{
	if(root == NULL)
		return;
	
	mid_travel(root->lchild, handler);
	handler(root);
	mid_travel(root->rchild, handler);
}

static void post_travel(NODE *root, void (*handler)(NODE *))
{
	if(root == NULL)
		return;

	post_travel(root->lchild, handler);
	post_travel(root->rchild, handler);
	handler(root);
}

/* ↓↓↓↓↓↓↓↓↓↓↓↓↓ 画网页相关算法代码 ↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓ */
static void level_travel(NODE *root, void (*handler)(NODE *))
{
	if(root == NULL)
		return;

    _linkqueue q;
	q = init_queue();

	en_queue(q, root);

    NODE *tmp;
	while(1)
	{
		if(!out_queue(q, &tmp))
			break;

		handler(tmp);

		if(tmp->lchild != NULL)
			en_queue(q, tmp->lchild);
		if(tmp->rchild != NULL)
			en_queue(q, tmp->rchild);
	}
}
/* ↓↓↓↓↓↓↓↓↓↓↓↓↓ 画网页相关算法代码 ↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓ */
static char page_begin[] = "<html><head><title>tree map"
                           "</title></head><body>"
			   "<table border=0 cellspacing"
                           "=0 cellpadding=0>";
static char line_begin[] = "<tr>";
static char line_end  [] = "</tr>";
static char space     [] = "<td>&nbsp;</td>";
static char underline [] = "<td style=\"border-bottom:"
	 		   "1px solid #58CB64\">&nbsp;"
                           "</td>";

#ifdef RB
static char data_begin_red[] = "<td bgcolor=\"#FF0000\";style="
			       "\"border:1px sol"
                               "id #58CB64;background-colo"
                               "r:#DDF1D8;PADDING:2px;\" t"
                               "itle=\"level: 1\">";
static char data_begin_blk[] = "<td bgcolor=\"#000000\";style="
			       "\"border:1px sol"
                               "id #58CB64;background-colo"
                               "r:#DDF1D8;PADDING:2px;\" t"
                               "itle=\"level: 1\"><font color"
				"=\"#FFFFFF\">";
static char data_end_red[] = "</td>";
static char data_end_blk[] = "</font></td>";
#else
static char data_begin[] = "<td style=\"border:1px sol"
                           "id #58CB64;background-colo"
                           "r:#DDF1D8;PADDING:2px;\" t"
                           "itle=\"level: 1\">";
static char data_end  [] = "</td>";
#endif

static char page_end  [] = "</table></body></html>";

#define MAX_NODES_NUMBER 100
#define FILENAME 32

static int central_order[MAX_NODES_NUMBER];

static void putunderline(int fd, int num)
{
	int i;
	for(i=0; i<num; i++)
	{
		write(fd, underline, strlen(underline));
	}
}


static void putspace(int fd, int num)
{
	int i;
	for(i=0; i<num; i++)
	{
		write(fd, space, strlen(space));
	}
}
/* ↓↓↓↓↓↓↓↓↓↓↓↓↓ 画网页相关算法代码 ↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓ */
#ifdef RB
static void putdata(int fd, NODE * p)
{
	char s[50];
	bzero(s, 50);

	snprintf(s, 50, "%d", p->data);

	switch(p->color)
	{
	case RED:
		write(fd, data_begin_red, strlen(data_begin_red));
		write(fd, s, strlen(s));
		write(fd, data_end_red, strlen(data_end_red));
		break;
	case BLACK:
		write(fd, data_begin_blk, strlen(data_begin_blk));
		write(fd, s, strlen(s));
		write(fd, data_end_blk, strlen(data_end_blk));
	}
}
#else
static void putdata(int fd, int data)
{
	char s[50] = {0};
	//bzero(s, 50);

	snprintf(s, 50, "%c", data);
	write(fd, data_begin, strlen(data_begin));
	write(fd, s, strlen(s));
	write(fd, data_end, strlen(data_end));
}
#endif

static int Index = 0;
static void create_index(NODE * root)
{
	if(Index >= MAX_NODES_NUMBER-1)
		return;

	central_order[Index++] = root->data;
}


static int get_index(int data)
{
	int i;
	for(i=0; i<100; i++)
	{
		if(central_order[i] == data)
			return i;
	}
	return -1;
}

/* ↓↓↓↓↓↓↓↓↓↓↓↓↓ 画网页相关算法代码 ↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓ */
static void data_leftside(int fd, NODE * root, int spaces)
{
	if(root == NULL)
		return;

	int s_line=0;

	if(root->lchild != NULL)
	{
		s_line = get_index(root->data)-
			 get_index(root->lchild->data)-1;
	}
	putspace(fd, spaces-s_line);
	putunderline(fd, s_line);
}


static int data_rightside(int fd, NODE * root)
{
	if(root == NULL)
		return 0;

	int s_line=0;

	if(root->rchild != NULL)
	{
		s_line = get_index(root->rchild->data)-
			 get_index(root->data)-1;
	}

	putunderline(fd, s_line);
	return s_line;
}


static void start_page(int fd)
{
	write(fd, page_begin, strlen(page_begin));
}

/* ↓↓↓↓↓↓↓↓↓↓↓↓↓ 画网页相关算法代码 ↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓ */
static void end_page(int fd)
{
	write(fd, page_end, strlen(page_end));
}

// 显示
static void draw(NODE * root)
{
	if(root == NULL)
		return;

	time_t t;
	time(&t);
	static char filename[FILENAME] = {0};
	//bzero(filename, FILENAME);
	snprintf(filename, FILENAME, "%u.html", (unsigned)t);
	int fd = open(filename, O_CREAT | O_TRUNC | O_RDWR, 0644);
	if(fd == -1)
	{
		perror("open() failed");
		exit(1);
	}

	Index = 0;
	mid_travel(root, create_index);

    _linkqueue q = init_queue();

	NODE * tmp = root;
	int ndata = 1;

	start_page(fd);
	while(1)
	{
		write(fd, line_begin, strlen(line_begin));

		int i, n = 0;
		int nextline = 0;
		for(i=0; i<ndata; i++)
		{
			int index = get_index(tmp->data);

			data_leftside(fd, tmp, index-n);

			#ifdef RB
			putdata(fd, tmp);
			#else
			// 如果想要在网页上显示字符，将putdata函数里面的sprintf()的%d换成%c
			putdata(fd, tmp->data);
			#endif
			int rightline = data_rightside(fd, tmp);

			if(tmp->lchild != NULL)
			{
				nextline++;
				en_queue(q, tmp->lchild);
			}
			if(tmp->rchild != NULL)
			{
				nextline++;
				en_queue(q, tmp->rchild);
			}
			if(!out_queue(q, &tmp))
				return;

			n = index + rightline;
			n++;
		}
		write(fd, line_end, strlen(line_end));
		ndata = nextline;
	}
	end_page(fd);
	close(fd);
}
#endif