Homework Clinic

Science Clinic => Computer Science => Topic started by: jace on May 6, 2020

Title: In a ________, the element j to be removed is always at the root.
Post by: jace on May 6, 2020

Question 1

The time complexity for insertion, deletion, and search is O(logn) for a ________.
◦ binary tree
◦ binary search tree
◦ AVL tree
◦ binary heap

Question 2

In a ________, the element j to be removed is always at the root.
◦ binary tree
◦ binary search tree
◦ AVL tree
◦ binary heap

Title: In a ________, the element j to be removed is always at the root.
Post by: bimper21 on May 6, 2020

Answer 1

AVL tree

Answer 2

binary heap

Title: Re: In a ________, the element j to be removed is always at the root.
Post by: Ethan Johnson on Dec 6, 2022

Thank you