1 True or false? (16 pts) For each of these statements, indicate if it is true (

Question

1 True or false? (16 pts) For each of these statements, indicate if it is true (T) or false (F). No justification needed. True False It takes O(lgn) to visit all the nodes in a binary tree of size n Deletions happen faster in a doubly-linked list than in a singly-linked list A tree is a BST if and only if for every node, its key is larger or equal than its leftD child's and smaller or equal than its right child's First in, first out (aka FIFO) describes the behaviour of the Queue data structure D Every Binary Search Tree is a nearly complete binary tree In a hash table, when two keys hash to the same position, the more recent one D overrides the previous one

Explanation / Answer

1) False
Explanation : False, it takes O(n) time to visit all nodes as number of nodes is n

2)False
Explanation : Deletion will happen in same way irrespective of DLL or SLL

3)True
Explanation BST property
4)True
Explanation: Its FIFO
5) False

6)True


Thanks, PLEASE RATE if helpful

Related Questions

Navigate

• Browse (All)
• Browse 1
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.