Let us construct the tree given in the above diagram
node root = new node ( 20 ) ; root . left = new node ( 8 ) ; root . left . left = new node ( 4 ) ; root . left . right = new node ( 12 ) ; root . left . right . left = new node ( 10 ) ; root . left . right . right = new node ( 14 ) ; root . right = new node ( 22 ) ; root . right . right = new node ( 25 ) ; Console . WriteLine ( " Size ▁ of ▁ the ▁ Largest ▁ Independent ▁ Set ▁ is ▁ " + liss ( root ) ) ; } }