How to write an algorithm for a binary search tree?

Question

Programming

The assignment says, consider a binary search tree: Add a dummy leaf v so that all pointers (left or right) that were NULL in the beginning now point to that leaf. Think about how you can speed up the algorithm so that all requests for NULL are ignored.
Can you help me figure out how to write this algorithm in pseudocode?

Answer 1

I advise you to refuse PhD