Scribd Logo
Upload

Welcome to Scribd!

  • Untitled

    Uploaded by

    meera vanathi
    12 views1 page
    This document discusses properties of binary trees including the maximum and minimum number of nodes given a height, the number of nodes at each level which is 2 to the power of i, that the number of leaf nodes is the number of nodes with two children plus one, and that the number of null nodes is the number of nodes plus one. It also provides one application of trees which is an expression tree where operands are at leaf nodes and operators are at internal nodes.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses properties of binary trees including the maximum and minimum number of nodes given a height, the number of nodes at each level which is 2 to the power of i, that the number of leaf nodes is the number of nodes with two children plus one, and that the number of null nodes is the number of nodes plus one. It also provides one application of trees which is an expression tree where operands are at leaf nodes and operators are at internal nodes.

    Copyright:

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

    Untitled

    Uploaded by

    meera vanathi
    This document discusses properties of binary trees including the maximum and minimum number of nodes given a height, the number of nodes at each level which is 2 to the power of i, that the number of leaf nodes is the number of nodes with two children plus one, and that the number of null nodes is the number of nodes plus one. It also provides one application of trees which is an expression tree where operands are at leaf nodes and operators are at internal nodes.

    Copyright:

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

    Data structures

    Tree
    Properties of binary tree
    Max no of nodes If height given is 2h+1-1
    Min no of nodes is h+1
    n+1=2h+1
    take log
    log2(n+1)-1=h
    n=h+1
    n-1=h
    no of nodes in a particular level is 2i
    no of leaf nodes is no of node having two children +1\
    no of null nodes is no of nodes +1
    application of tree
    1. expression tree _ operand at leaf node and operator at internode

    You might also like