Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightThe depth of a complete binary tree is given by

The depth of a complete binary tree is given by

  • Q. The depth of a complete binary tree is given by
  • filter_dramaExplanation
    Answer is : D
    None.

Discussion

    No one started the discussion yet. Break the ice and start the conversation.
    Please Login to be part of the discussion.

Similar Questions

  • 1. A binary tree having n nodes and depth d will be about complete binary tree if
  • filter_dramaExplanation
    Answer is : B
    None.
  • 2. When representing any algebraic expression E which uses only binary operations in a 2-tree
  • filter_dramaExplanation
    Answer is : A
    None.
  • 3. One can make an exact replica of a Binary Search Tree by traversing it in ...............
  • filter_dramaExplanation
    Answer is : B
    None.
  • 4. The in order traversal of tree will yield a sorted listing of elements of tree in
  • filter_dramaExplanation
    Answer is : B
    None.
  • 5. In a full binary tree if number of internal nodes is I, then number of nodes N are?
  • filter_dramaExplanation
    Answer is : D
    None.

Data StructureTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points