Scribd Logo
Upload

Welcome to Scribd!

  • Rotacoes

    Uploaded by

    Hallan
    5 views1 page
    This document describes functions for rotating nodes within a binary search tree. The __left_rotate function describes rotating a node x to the left by making its right child y the new parent node, reassigning child and parent pointers. The __right_rotate function describes an analogous right rotation of node x by making its left child y the new parent and reassigning pointers. Both functions update the parent pointers of affected nodes to maintain the tree structure.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document describes functions for rotating nodes within a binary search tree. The __left_rotate function describes rotating a node x to the left by making its right child y the new parent node, reassigning child and parent pointers. The __right_rotate function describes an analogous right rotation of node x by making its left child y the new parent and reassigning pointers. Both functions update the parent pointers of affected nodes to maintain the tree structure.

    Copyright:

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

    Rotacoes

    Uploaded by

    Hallan
    This document describes functions for rotating nodes within a binary search tree. The __left_rotate function describes rotating a node x to the left by making its right child y the new parent node, reassigning child and parent pointers. The __right_rotate function describes an analogous right rotation of node x by making its left child y the new parent and reassigning pointers. Both functions update the parent pointers of affected nodes to maintain the tree structure.

    Copyright:

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

    # rotate left at node x

    def __left_rotate(self, x):


    y = x.right
    x.right = y.left
    if y.left != None:
    y.left.parent = x

    y.parent = x.parent
    if x.parent == None:
    self.root = y
    elif x == x.parent.left:
    x.parent.left = y
    else:
    x.parent.right = y
    y.left = x
    x.parent = y

    # rotate right at node x


    def __right_rotate(self, x):
    y = x.left
    x.left = y.right
    if y.right != None:
    y.right.parent = x

    y.parent = x.parent;
    if x.parent == None:
    self.root = y
    elif x == x.parent.right:
    x.parent.right = y
    else:
    x.parent.left = y

    y.right = x
    x.parent = y

    You might also like