Lowest Common Ancestor of Binary Search Tree

Posted on

Screen Shot 2015-10-02 at 1.46.13 PM

Idea:

  1. key point: locate p, q in the tree according to the node values
  2. p, q in the same child tree or not?
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s