Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightThe post order traversal of a binary tree is DEBFCA. Find out the pre ...

The post order traversal of a binary tree is DEBFCA. Find out the pre ...

  • Q. The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
  • 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. The complexity of Binary search algorithm is
  • filter_dramaExplanation
    Answer is : C
    None.
  • 2. The number of nodes that have no successors in a complete binary tree of depth 4 is
  • filter_dramaExplanation
    Answer is : B
    None.
  • 3. What is wrong with below code for inorder traversal of inorder threaded binary tree:

    inordertraversal(threadedtreenode root):
   threadedtreenode q = inorderpredecessor(root)
   while(q!=root):
   q=inorderpredecessor(q)
   print q.data
  • filter_dramaExplanation
    Answer is : A
    None.
  • 4. Which of the following is correct with respect to binary trees?
  • filter_dramaExplanation
    Answer is : D
    None.
  • 5. When to choose Red-Black tree, AVL tree and B-trees?
  • filter_dramaExplanation
    Answer is : A
    None.

Data StructureTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points