logo

CuriousTab

CuriousTab

Discussion


Home Technical Questions Software Testing See What Others Are Saying!
  • Question
  • Of the following tree structure, which is, efficient considering space and time complexities?


  • Options
  • A. Incomplete Binary Tree
  • B. Complete Binary Tree
  • C. Full Binary Tree
  • D. None

  • Correct Answer
  • Complete Binary Tree 

    Explanation

    Full binary tree loses its nature when operations of insertions and deletions are done. For incomplete binary trees, extra storage is required and overhead of NULL node checking takes place. So complete binary tree is the better one since the property of complete binary tree is maintained even after operations like additions and deletions are done on it.


  • More questions

    • 1. In the relational model, relationships between relations or tables are created by using:

    • Options
    • A. composite keys.
    • B. determinants.
    • C. candidate keys.
    • D. foreign keys.
    • Discuss
    • 2. What does microprocessor speed depend on?
    • Discuss
    • 3. What does RSI stand for?
    • Discuss
    • 4. Which Stack is used in 8086?
    • Discuss
    • 5. What is object repository?
    • Discuss
    • 6. Which is the Stack used in 8085?
    • Discuss
    • 7. What does GUI stand for?
    • Discuss
    • 8. What is the main reason the OSI Model was created?
    • Discuss
    • 9. Ethernet uses which topology

    • Options
    • A. Star
    • B. Bus
    • C. Twisted pair
    • D. Both B & C
    • Discuss
    • 10. What are various scheduling queues?
    • Discuss


    Comments

    There are no comments.

Enter a new Comment