Ejemplo n.º 1
0
        public List <List <double> > pathSum(TreeAndGraph.BinaryTreeNode root, int sum)
        {
            List <List <double> > solution = new List <List <double> >();
            int height = root.getHeight();

            count = new double[height];
            PreDPS(root, solution, sum, count, 0);
            return(solution);
        }