Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightBinary Trees

Binary Trees MCQs

chevron_left Back Page 1/12 chevron_right Next
  • 1. A binary tree whose every node has either zero or two children is called
  • filter_dramaExplanation
    Answer is : C
    None.
  • 2. The depth of a complete binary tree is given by
  • filter_dramaExplanation
    Answer is : D
    None.
  • 3. When representing any algebraic expression E which uses only binary operations in a 2-tree
  • filter_dramaExplanation
    Answer is : A
    None.
  • 4. A binary tree can easily be converted into q 2-tree
  • filter_dramaExplanation
    Answer is : D
    None.
  • 5. . When converting binary tree into extended binary tree, all the original nodes in binary tree are
  • filter_dramaExplanation
    Answer is : A
    None.
  • 6. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
  • filter_dramaExplanation
    Answer is : C
    None.
  • 7. An algorithm that calls itself directly or indirectly is known as
  • filter_dramaExplanation
    Answer is : B
    None.
  • 8. 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.
  • 9. The in order traversal of tree will yield a sorted listing of elements of tree in
  • filter_dramaExplanation
    Answer is : B
    None.
  • 10. The complexity of Binary search algorithm is
  • filter_dramaExplanation
    Answer is : B
    None.
chevron_left Back Page 1/12 chevron_right Next
leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points