|515|[Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_515.java) | O(n) |O(k) | Medium| BFS

|514|[Freedom Trail](https://leetcode.com/problems/freedom-trail/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_514.java) | O(?) |O(?) | Hard | DP

|513|[Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_513.java) | O(n) |O(k) | Medium| BFS

|508|[Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/MostFrequentSubtreeSum.java) | O(n) |O(n) | Medium| DFS, Tree

|508|[Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_508.java) | O(n) |O(n) | Medium| DFS, Tree

|507|[Perfect Number](https://leetcode.com/problems/perfect-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/PerfectNumber.java) | O(sqrt(n)) |O(1) | Easy| Math

|506|[Relative Ranks](https://leetcode.com/problems/relative-ranks/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_506.java)| O(nlogn)|O(n)| Easy|

|505|[The Maze II](https://leetcode.com/problems/the-maze-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_505.java) | O(m*n) |O(m*n) | Medium| BFS

importjava.util.*;

publicclassMostFrequentSubtreeSum {

publicclass_508 {

publicint[]findFrequentTreeSum(TreeNoderoot) {

packagecom.fishercoder;

importcom.fishercoder.common.classes.TreeNode;

importcom.fishercoder.solutions.MostFrequentSubtreeSum;

importcom.fishercoder.solutions._508;

importorg.junit.Before;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticorg.junit.Assert.assertArrayEquals;

publicclassMostFrequentSubtreeSumTest {

privatestaticMostFrequentSubtreeSumtest;

publicclass_508Test {

privatestatic_508test;

privatestaticint[]expected;

privatestaticint[]actual;

privatestaticTreeNoderoot;

publicstaticvoidsetup(){

test =newMostFrequentSubtreeSum();

test =new_508();

}