Verified Study Solutions
Binary Search Tree properties ANS Each node has 0 to 2 children
Children on left are less than parent
Children on right are greater than parent
Dynamic Set Operations ANS Add, Delete, Minimum, Maximum, Search, Predecessor, Successor
Binary Search Tree minimum ANS Returns the bottom left most node
Binary Search Tree Maximum ANS Returns the bottom right most node
In order traversal ANS left, root, right
Pre order traversal ANS root, left, right
Post order traversal ANS left, right, root
Tree predecessor ANS returns the greatest number less than x
Tree successor ANS returns the lowest number greater than x
Which traversal helps with predecessor/successor ANS In Order traversal
Binary search tree search runtime ANS O(h)
Binary search tree insert runtime ANS O(logn)
Binary search tree transplant runtime ANS O(1)