Binary Search Tree Proof (Algorithms)

  • Status Closed
  • Budget $10 - $30 USD
  • Total Bids 7

Project Description

Hello Freelancers,

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

Get free quotes for a project like this
Skills Required

Looking to make some money?

  • Set your budget and the timeframe
  • Outline your proposal
  • Get paid for your work

Hire Freelancers who also bid on this project

    • Forbes
    • The New York Times
    • Time
    • Wall Street Journal
    • Times Online