二叉搜索树(BST)中的两个节点被错误地交换了, 请在不改变树的结构的情况下恢复这棵树。
<?php
class Node{
public $left = null;
public $right = null;
public $val;
public function __construct($val) {
$this->val = $val;
}
}
function recoverTree($node) {
$a = $b = $preNode = null;
getErrorNode($node, $a, $b, $preNode);
if ($a !== null && $b != null) {
$tmp = $a->val;
$a->val = $b->val;
$b->val = $tmp;
}
return $node;
}
function getErrorNode($node, &$a, &$b, &$preNode) {
if ($node == null) {
return;
}
getErrorNode($node->left, $a, $b, $preNode);//左子树<根节点<右子树
if ($preNode != null && $preNode->val > $node->val) {
//如果前一个节点大于后一个节点,说明是有问题的
if ($a == null) {
$a = $preNode;//第一个有错误的节点,前一个是被替换的
}
$b = $node;//第二个有错误的节点就是被替换的
}
$preNode = $node;
getErrorNode($node->right, $a, $b, $preNode);
}
$node1 = new Node(6);
$node2 = new Node(8);
$node3 = new Node(7);
$node4 = new Node(6);
$node5 = new Node(2);
$node1->left = $node2;
$node1->right = $node3;
$node3->left = $node4;
$node3->right = $node5;
$node = recoverTree($node1);
output($node);
function output($node) {
print $node->val."\t";
print "左".$node->left->val."右".$node->right->val."\n";
if ($node->left != null) {
output($node->left);
}
if ($node->right != null) {
output($node->right);
}
print "\n";
}