Frequently Asked Questions

Note: I am putting these here because students have asked them in the past, this is not a reflection of what will be on quizzes. 

Q: If a node is removed, does it collapse the children nodes beneath it, or will they be stitched back in like in a linked list?

A: As with the Linked List, it depends on how you write the algorithm. You will see in future videos how to remove a node without losing its children but there are some implementations of trees where that is not done and the children are lost. 

Q: When would we use a bst instead of a linked list?

A: Any time order matters, BSTs order information from smallest to greatest.