Scribd Logo
Upload

Welcome to Scribd!

  • AVL Tree

    Uploaded by

    anudavaanym
    4 views1 page
    1. AVL trees use the balance factor (bf), which is the height of the left subtree minus the height of the right subtree, to maintain balance during insertions and deletions. The balance factor must be between -1 and 1. 2. An example shows the balance factors and heights after inserting numbers into an initially empty AVL tree in the order 2, 7, 3, 5, 6, 8, 9, 4. 3. The document then shows the tree after deleting nodes 2, 1, and 7 in order.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    1. AVL trees use the balance factor (bf), which is the height of the left subtree minus the height of the right subtree, to maintain balance during insertions and deletions. The balance factor must be between -1 and 1. 2. An example shows the balance factors and heights after inserting numbers into an initially empty AVL tree in the order 2, 7, 3, 5, 6, 8, 9, 4. 3. The document then shows the tree after deleting nodes 2, 1, and 7 in order.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views1 page

    AVL Tree

    Uploaded by

    anudavaanym
    1. AVL trees use the balance factor (bf), which is the height of the left subtree minus the height of the right subtree, to maintain balance during insertions and deletions. The balance factor must be between -1 and 1. 2. An example shows the balance factors and heights after inserting numbers into an initially empty AVL tree in the order 2, 7, 3, 5, 6, 8, 9, 4. 3. The document then shows the tree after deleting nodes 2, 1, and 7 in order.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    AVL trees

    balance factor =
    height of left subtree -

    height of right subtree

    bf = he -
    hr = 2 1,- 0
    ,
    13 .

    1bf) = /he -
    hr1 < .
    1

    on empty tree insertion 1 2, 7 3 5 6, 8 9, 4 , 4


    ·

    , , , , , ,

    i2 + ↓7 +t
    ( + +, + ) 2
    i 2 is
    1 - 1 ->
    -

    -1
    ,
    t
    2
    20
    7 I 7 I y 1

    O O O

    D
    +t
    2 2 2 +t 5
    O

    16
    if
    >
    (
    (--it) +)
    -

    + +, >

    ~
    -

    I 5
    ,
    I 5 2 7
    q
    --

    I
    3 q +
    3 1 3 ⑥

    +
    3
    6

    5 5 5
    in
    19 >
    -

    >

    L if L
    7 if
    2

    I · I
    B G 3 G ·
    I 3 G ·

    g 4 g

    ·
    Delete

    t =
    < [C1) 2] 3 [(7293) 10(11)]} Delete 2, 1, 7 in order
    .

    O
    ④
    + t
    3 3 7
    D2

    -g
    D1
    ⑩
    ·
    7 + +, -

    =>
    -
    B 10
    ,
    2 I 10-
    10 /
    9 If
    I 7
    # 11 7.
    .

    G g g

    B7
    3 10
    ,

    11

    You might also like