I have a question regarding proving a lemma for a BST.
Lemma: If a node X in a binary search tree has two children, then its successor S has no left child and its predecessor P has no right child.
Complete question will be attached!
Time: Within 20 hours or before 11 PM Hawaii standard time (October 7, 2016)
[url removed, login to view]+standard+time
7 freelancers are bidding on average $33 for this job
AI expert, Solid software engineer with 17+ experience, well versed in mathematics. This is a simple proof. I am native english speaker, and can write a clear and simple proof.