Scribd Logo
Upload

Welcome to Scribd!

  • Binary Tree

    Uploaded by

    joshi
    6 views23 pages
    This document discusses binary search trees and provides examples of inorder, preorder, and postorder traversals of one tree. The inorder traversal lists the nodes from left to right as 10, 20, 30, 100, 150, 200, 300. The preorder traversal lists the root node first followed by left and right subtrees as 100, 20, 10, 30, 200, 150, 300. The postorder traversal lists the left and right subtrees first followed by the root node as 10, 30, 20, 150, 300, 200, 100.

    Original Description:

    Original Title

    Bst

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses binary search trees and provides examples of inorder, preorder, and postorder traversals of one tree. The inorder traversal lists the nodes from left to right as 10, 20, 30, 100, 150, 200, 300. The preorder traversal lists the root node first followed by left and right subtrees as 100, 20, 10, 30, 200, 150, 300. The postorder traversal lists the left and right subtrees first followed by the root node as 10, 30, 20, 150, 300, 200, 100.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views23 pages

    Binary Tree

    Uploaded by

    joshi
    This document discusses binary search trees and provides examples of inorder, preorder, and postorder traversals of one tree. The inorder traversal lists the nodes from left to right as 10, 20, 30, 100, 150, 200, 300. The preorder traversal lists the root node first followed by left and right subtrees as 100, 20, 10, 30, 200, 150, 300. The postorder traversal lists the left and right subtrees first followed by the root node as 10, 30, 20, 150, 300, 200, 100.

    Copyright:

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

    Binary Tree-

    Number of Binary Search Trees-


    The number of nodes in the left subtree and right subtree of the root respectively is _____.
    Inorder Traversal: 10 20 30 100 150 200 300
    Preorder Traversal: 100 20 10 30 200 150 300
    Postorder Traversal: 10 30 20 150 300 200 100

    You might also like