Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightA binary tree whose every node has either zero or two children is call...

A binary tree whose every node has either zero or two children is call...

  • Q. A binary tree whose every node has either zero or two children is called
  • filter_dramaExplanation
    Answer is : C
    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. What is the parent for a node
  • filter_dramaExplanation
    Answer is : A
    None.
  • 2. Average case time complexity of binary search is ______________
  • filter_dramaExplanation
    Answer is : D
    None.
  • 3. The linked representation of a binary tree is implemented by using a linked list having an_________.
  • filter_dramaExplanation
    Answer is : C
    None.
  • 4. What is a full binary tree?
  • filter_dramaExplanation
    Answer is : A
    None.
  • 5. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
  • filter_dramaExplanation
    Answer is : C
    None.

Data StructureTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points