写在前面:
一,本文侧重诠释对算法的思考记录过程,忽略其他诸如代码简洁、字符编码等细节问题。
二,本文结合 平衡二叉树插入之旋转图示 这篇一起看,有助于理解。
<?php
class Node {
public $data;
public $left = NULL;
public $right = NULL;
public $bf = 0;
public $parent = NULL;
public function __construct($data) {
$this->data = $data;
}
}
//平衡二叉树,也叫 AVL 树(平衡二叉树作者的名字首字母),是自平衡的二叉查找树,
//要求每个节点的左子树和右子树的高度差至多等于 1,
//这个高度(深度)差的值叫做平衡因子 BF,也就是说 BF 的值不能大于1,
//距离插入节点最近的,且平衡因子绝对值大于 1 的节点为根的子树,叫做最小不平衡子树,
//一旦出现最小不平衡子树时,就进行左旋、右旋或双旋处理,以保持自身始终平衡
//算法复杂度:O(logn)
class AvlTree {
private static $tree;
const LH = 1; // 左子树高(高度差)
const EH = 0; // 等高
const RH = -1; // 右子树高(高度差)
public function getTree() {
return self::$tree;
}
//中序遍历
public function midOrderTraverse($p) {
if (!$p) {
return;
}
$this->midOrderTraverse($p->left);
printf("%s\n", $p->data);
// var_dump($p);
$this->midOrderTraverse($p->right);
}
public function insert($data) {
$this->insertNode($data, self::$tree);
}
public function insertNode($data, &$tree) {
if (!$tree) {
$tree = new Node($data);
return TRUE;
}
if ($data < $tree->data) {
if (!$this->insertNode($data, $tree->left)) {
return FALSE;
} else {
if (empty($tree->left->parent)) {
$tree->left->parent = $tree;
}
switch ($tree->bf) {
case self::LH:
$this->leftBalance($tree);
return FALSE;
case self::EH:
$tree->bf = self::LH;
return TRUE;
case self::RH:
$tree->bf = self::EH;
return FALSE;
}
}
} elseif ($data > $tree->data) {
if (!$this->insertNode($data, $tree->right)) {
return FALSE;
} else {
if (empty($tree->right->parent)) {
$tree->right->parent = $tree;
}
switch ($tree->bf) {
case self::LH:
$tree->bf = self::EH;
return FALSE;
case self::EH:
$tree->bf = self::RH;
return TRUE;
case self::RH:
$this->rightBalance($tree);
return FALSE;
}
}
}
}
public function leftBalance($tree) {
$subTree = $tree->left;
switch ($subTree->bf) {
case $this::LH:
// 新插入节点在左子节点的左子树上要做右单旋处理
$tree->bf = $subTree->bf = $this::EH;
$this->rightRotate($tree);
break;
case $this::RH:
// 新插入节点在左子节点的右子树上要做双旋处理
$subTree_r = $subTree->right;
switch ($subTree_r->bf) {
case $this::LH:
$subTree->bf = $this::EH;
$tree->bf = $this::RH;
break;
case $this::RH:
$tree->bf = $this::EH;
$subTree->bf = $this::LH;
break;
}
$subTree_r->bf = $this::EH;
$this->leftRotate($subTree);
$this->rightRotate($tree);
break;
}
}
public function rightBalance($tree) {
$subTree = $tree->right;
switch ($subTree->bf) {
case $this::RH:
//新插入节点在右子节点的右子树上要做左单旋处理
$tree->bf = $subTree->bf = $this::EH;
$this->leftRotate($tree);
break;
case $this::LH:
//新插入节点在右子节点的左子树上要做双旋处理
$subTree_l = $subTree->left;
switch ($subTree_l->bf) {
case $this::RH:
$tree->bf = $this::LH;
$subTree->bf = $this::EH;
break;
case $this::LH:
$tree->bf = $this::EH;
$subTree->bf = $this::RH;
break;
}
$subTree_l->bf = $this::EH;
$this->rightRotate($subTree);
$this->leftRotate($tree);
break;
}
}
//右单旋
public function rightRotate($tree) {
$subTree = $tree->left;
if ($tree->parent) {
$subTree->parent = $tree->parent;//更新新子树的父节点
$left = FALSE;
if ($tree->parent->left == $tree) {
$left = TRUE;
}
} else {
$subTree->parent = NULL;
}
$tree->left = $subTree->right;//原来左节点的右子树挂到老的根节点的左子树
$subTree->right->parent = $tree;
$tree->parent = $subTree;//原来的左节点变成老的根节点的父节点
$subTree->right = $tree;//原来的根节点变成原来左节点的右子树
$tree = $subTree;
if (!$tree->parent) {//旋转的是整棵树的根节点
self::$tree = $tree;
} else {
if ($left) {//更新老的子树根节点父节点指针指向新的根节点
$tree->parent->left = $tree;
} else {
$tree->parent->right = $tree;
}
}
}
//左单旋
public function leftRotate($tree) {
$subTree = $tree->right;
if ($tree->parent) {
$subTree->parent = $tree->parent;
$left = FALSE;
if ($tree->parent->left == $tree) {
$left = TRUE;
}
} else {
$subTree->parent = NULL;
}
$tree->right = $subTree->left;
$subTree->left->parent = $tree;
$tree->parent = $subTree;
$subTree->left = $tree;
$tree = $subTree;
if (!$tree->parent) {
self::$tree = $tree;
} else {
if ($left) {
$tree->parent->left = $tree;
} else {
$tree->parent->right = $tree;
}
}
}
}
//下面是测试数据
$treeObj = new AvlTree();
//右单旋测试
$treeObj->insert(120);
$treeObj->insert(99);
$treeObj->insert(78);
$treeObj->insert(66);
$treeObj->insert(83);
$treeObj->insert(110);
$treeObj->insert(130);
$tree = $treeObj->getTree();
$treeObj->midOrderTraverse($tree);//66 78 83 99 110 120 130
// echo "<br/>";
// $treeObj->insert(107);
// $treeObj->insert(102);
// $tree = $treeObj->getTree();
// $treeObj->midOrderTraverse($tree);//66 78 83 99 102 107 110 120 130
// echo "<br/>";
// $treeObj->insert(127);
// $treeObj->insert(125);
// $tree = $treeObj->getTree();
// $treeObj->midOrderTraverse($tree);//66 78 83 99 110 120 125 127 130
// echo "<br/>";
// $treeObj->insert(57);
// $treeObj->insert(72);
// $treeObj->insert(50);
// $tree = $treeObj->getTree();
// $treeObj->midOrderTraverse($tree);//50 57 66 72 78 83 99 110 120 130
//右双旋测试--先左旋再右旋
// echo "<br/>";
// $treeObj->insert(57);
// $treeObj->insert(72);
// $treeObj->insert(70);
// $tree = $treeObj->getTree();
// $treeObj->midOrderTraverse($tree);//57 66 70 72 78 83 99 110 120 130
// echo "<br/>";
// $treeObj->insert(57);
// $treeObj->insert(72);
// $treeObj->insert(75);
// $tree = $treeObj->getTree();
// $treeObj->midOrderTraverse($tree);//57 66 72 75 78 83 99 110 120 130
// echo "<br/>";
// $treeObj->insert(57);
// $treeObj->insert(72);
// $treeObj->insert(70);
// $treeObj->insert(75);
// $tree = $treeObj->getTree();
// $treeObj->midOrderTraverse($tree);//57 66 70 72 75 78 83 99 110 120 130
//左单旋测试
// $treeObj->insert(78);
// $treeObj->insert(99);
// $treeObj->insert(120);
// $treeObj->insert(66);
// $treeObj->insert(83);
// $treeObj->insert(110);
// $treeObj->insert(130);
// $tree = $treeObj->getTree();
// $treeObj->midOrderTraverse($tree);//66 78 83 99 110 120 130
// echo "<br/>";
// $treeObj->insert(150);
// $treeObj->insert(170);
// $tree = $treeObj->getTree();
// $treeObj->midOrderTraverse($tree);//66 78 83 99 110 120 130 150 170
// echo "<br/>";
// $treeObj->insert(113);
// $treeObj->insert(118);
// $tree = $treeObj->getTree();
// $treeObj->midOrderTraverse($tree);//66 78 83 99 110 113 118 120 130
// echo "<br/>";
// $treeObj->insert(80);
// $treeObj->insert(85);
// $treeObj->insert(87);
// $tree = $treeObj->getTree();
// $treeObj->midOrderTraverse($tree);//66 78 80 83 85 87 99 110 120 130
//左双旋测试--先右旋再左旋
// echo "<br/>";
// $treeObj->insert(80);
// $treeObj->insert(85);
// $treeObj->insert(79);
// $tree = $treeObj->getTree();
// $treeObj->midOrderTraverse($tree);//66 78 79 80 83 85 99 110 120 130
// echo "<br/>";
// $treeObj->insert(80);
// $treeObj->insert(85);
// $treeObj->insert(81);
// $tree = $treeObj->getTree();
// $treeObj->midOrderTraverse($tree);//66 78 80 81 83 85 99 110 120 130
// echo "<br/>";
// $treeObj->insert(80);
// $treeObj->insert(85);
// $treeObj->insert(79);
// $treeObj->insert(81);
// $tree = $treeObj->getTree();
// $treeObj->midOrderTraverse($tree);//66 78 79 80 81 83 85 99 110 120 130
参考来源:https://xueyuanjun.com/books/data-structure-and-algorithms