perl 实现二叉树，二叉平衡树

最新推荐文章于 2020-05-25 00:12:30 发布

xuan_oscar

最新推荐文章于 2020-05-25 00:12:30 发布

阅读量1.1k

点赞数

CC 4.0 BY-SA版权

分类专栏： linux 文章标签： perl tree insert delete search layer

本文链接：https://blog.youkuaiyun.com/xuan_oscar/article/details/4568205

这段Perl代码展示了如何创建并操作一个AVL树，包括插入节点、删除节点以及平衡调整。代码中定义了旋转操作如左旋、右旋以及双旋，还包含了插入节点的函数和树的删除操作。通过Dumper函数输出树的状态来展示操作结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#! /usr/bin/perl -w
use strict;
use warnings;
use Data::Dumper;

my $head = undef;
my $copy = /$head;

foreach my $index( 1 .. 10 ){
&AVLTree_insert($copy, $index);
}
#&create_BSTree( $copy );
#&create_tree( $copy );
print Dumper ( $head );
&tree_delete( $copy, 1 );

print Dumper ( $head );
#&afterward_travel($head);
#&middle_travel($head);
#&layer_travel ( $head );
#&search_BST( $head, 23);

sub max{
    my ( $a, $b) = @_;
    return $a > $b ? $a : $b;
}
sub ll_rotate {
    my $root = shift;
    my $x = $$root;
    my $y = $x->{left};
    $x->{left} = $y->{right};
    $y->{right} = $x;
    $$root = $x;
    $x->{height} = &max( &height( $x->{left} ), &height( $x->{right} ) ) + 1;
    $y->{height} = &max( &height( $y->{left} ), &height( $y->{right} )) + 1;
}

sub rr_rotate {
    my $root = shift;
    my $x = $$root;
    my $y = $x->{right};
    $x->{right} = $y->{left};
    $y->{left} = $x;
    $$root = $y;
    $x->{height} = &max( &height( $x->{left} ), &height( $x->{right} ) ) + 1;
    $y->{height} = &max( &height( $y->{left} ), &height( $y->{right} ) ) + 1;
}
sub lr_rotate {
    my $root = shift;
    my $x = $$root;
    my $y = $x->{left};
    &rr_rotate( /$x->{left});
    &ll_rotate ( $root);
}

sub rl_rotate {
    my $root = shift;
    my $x = $$root;
    my $y = $x->{right};
    &ll_rotate( /$x->{right});
    &rr_rotate( $root);
}

sub AVLTree_insert{
    my ( $tree, $value ) = @_;
    if ( !defined $$tree ){
        $$tree = {
                    height => 0,
                    left   => undef,
                    right => undef,
                    value => $value,
                 }
    }
    else {
        if ( $$tree->{value} > $value ){
           &AVLTree_insert( /$$tree->{left}, $value);
           if ( (&height( $$tree->{left} ) - &height( $$tree->{right}) ) == 2 ){
               if ($value < $$tree->{left}->{value}){
                   &ll_rotate( $tree );
               }
               else {
                   &lr_rotate( $tree );
               }
           }
        }
        else{
           &AVLTree_insert( /$$tree->{right}, $value);
           if ( ( &height( $$tree->{right} ) - &height( $$tree->{left} )) == 2){
               if ( $value > $$tree->{right}->{value}){
                 &nbs