Largest Independent Set in Binary Tree

Given a Binary Tree, we have to find the size of Largest Independent Set (LIS) in it. A subset of all tree nodes is an independent set if there is no edge between any two nodes of the subset.


This is a companion discussion topic for the original entry at http://iq.opengenus.org/largest-independent-set-in-binary-tree/