Scribd Logo
Upload

Welcome to Scribd!

  • Tuchi

    Uploaded by

    Ch saab14
    10 views1 page
    This Python code defines a class called dfs that represents a node in a binary tree. It contains attributes for the node's data and left/right child nodes. An inorder traversal method is defined to recursively print the values of nodes from left children to the root to right children. The main method builds a sample binary tree and calls inorder to print the values in ascending order from 4 to 8.

    Original Description:

    Original Title

    tuchi

    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 Python code defines a class called dfs that represents a node in a binary tree. It contains attributes for the node's data and left/right child nodes. An inorder traversal method is defined to recursively print the values of nodes from left children to the root to right children. The main method builds a sample binary tree and calls inorder to print the values in ascending order from 4 to 8.

    Copyright:

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

    Tuchi

    Uploaded by

    Ch saab14
    This Python code defines a class called dfs that represents a node in a binary tree. It contains attributes for the node's data and left/right child nodes. An inorder traversal method is defined to recursively print the values of nodes from left children to the root to right children. The main method builds a sample binary tree and calls inorder to print the values in ascending order from 4 to 8.

    Copyright:

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

    class dfs:

    def __init__(self, data=None, left=None, right=None):

    self.data = data
    self.left = left
    self.right = right

    def inorder(root):

    inorder(root.left)

    print(root.data, end=' ')

    inorder(root.right)

    if __name__ == '__main__':

    root = dfs(1)
    root.left = dfs(2)
    root.right = dfs(3)
    root.left.left = dfs(4)
    root.right.left = dfs(5)
    root.right.right = dfs(6)
    root.right.left.left = dfs(7)
    root.right.left.right = dfs(8)

    inorder(root)

    You might also like