Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightAn algorithm that calls itself directly or indirectly is known as

An algorithm that calls itself directly or indirectly is known as

  • Q. An algorithm that calls itself directly or indirectly is known as
  • 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. What are null nodes filled with in a threaded binary tree?
  • filter_dramaExplanation
    Answer is : A
    None.
  • 2. The in-order traversal of a binary tree is HFIEJGZ, and the post-order traversal of the same tree is HIFJZGE. What will be the total number of nodes in the left sub tree of the given tree? (It is NOT a search tree)
  • filter_dramaExplanation
    Answer is : C
    None.
  • 3. The number of nodes in a complete binary tree of level 5 is
  • filter_dramaExplanation
    Answer is : C
    None.
  • 4. One can determine whether a Binary tree is a Binary Search Tree by traversing it in ................
  • filter_dramaExplanation
    Answer is : B
    None.
  • 5. The depth of a complete binary tree with 'n nodes is (log is to be base two)
  • 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