Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightIn an arbitrary tree ( not a search tree) of order M. Its size is N, a...

In an arbitrary tree ( not a search tree) of order M. Its size is N, a...

  • Q. In an arbitrary tree ( not a search tree) of order M. Its size is N, and its height is K. The computation time needed to find a data item on T is
  • 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 nodes belonging to the same parent node are known as_________.
  • filter_dramaExplanation
    Answer is : B
    None.
  • 2. Can a tree stored in an array using either one of inorder or post order or pre order traversals be again reformed?
  • filter_dramaExplanation
    Answer is : B
    None.
  • 3. In order traversal of binary search tree will produce ?
  • filter_dramaExplanation
    Answer is : C
    None.
  • 4. What must be the ideal size of array if the height of tree is
  • filter_dramaExplanation
    Answer is : A
    None.
  • 5. After applying the below operations on a input sequence, what happens?

    i. construct a cartesian tree for input sequence

    ii. put the root element of above tree in a priority queue

    iii. if( priority queue is not empty) then

    .search and delete minimum value in priority queue

    .add that to output

    .add cartesian tree children of above node to priority queue
  • filter_dramaExplanation
    Answer is : B
    None.

Data StructureTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points