Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightThe complexity of Binary search algorithm is

The complexity of Binary search algorithm is

  • Q. The complexity of Binary search algorithm is
  • filter_dramaExplanation
    Answer is : B
    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. A binary tree is a special type of tree, which can either be empty or have a finite set of nodes, such that, one of the nodes is designated as the root node and the remaining nodes are partitioned into sub trees of the root nodes known as__________.
  • filter_dramaExplanation
    Answer is : C
    None.
  • 2. A binary tree whose every node has either zero or two children is called
  • filter_dramaExplanation
    Answer is : C
    None.
  • 3. What is the time complexity for finding the height of the binary tree?
  • filter_dramaExplanation
    Answer is : D
    None.
  • 4. A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with 10 leaves
  • filter_dramaExplanation
    Answer is : B
    None.
  • 5. A binary search tree, also known as_________.
  • 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