Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightIn a binary tree, certain null entries are replaced by special pointer...

In a binary tree, certain null entries are replaced by special pointer...

  • Q. In a binary tree, certain null entries are replaced by special pointers which point to nodes higher in the tree for efficiency. These special pointers are called
  • 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. Best case time complexity of binary search is ______________
  • filter_dramaExplanation
    Answer is : D
    None.
  • 2. When converting binary tree into extended binary tree, all the original nodes in binary tree are
  • filter_dramaExplanation
    Answer is : A
    None.
  • 3. What is the parent for a node
  • filter_dramaExplanation
    Answer is : A
    None.
  • 4. What is a complete binary tree?
  • filter_dramaExplanation
    Answer is : C
    None.
  • 5. A full binary tree with n non-leaf nodes contains
  • 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