Maximum Disjoint Subtree Product - World codesprint 10 (II)

May 3, 2017

Introduction

The algorithm is one of hard level in the hackerrank world codesprint 10. Julia put together a C# code after she chose to study one of C# submissions in the contest. She likes to ask code review on stackexchange.com.

The algorithm is a depth first search algorithm, after over a few hours study, the algorithm becomes easy to understand.

Here is the C# code almost ready for code review.

Code review 

Code review link is here.