Algorithms Lowest common ancestor of a binary tree suggest change

Lowest common ancestor of a Binary Tree

Introduction

Lowest common ancestor between two nodes n1 and n2 is defined as the lowest node in the tree that has both n1 and n2 as descendants.

Feedback about page:

Feedback:
Optional: your email if you want me to get back to you:



Table Of Contents