递归找到当前的节点呈现树形菜单结构

         parents = list.Where(p => p.ParentId == 0 || p.ParentId == null).ToList();
            childrens = list.Where(p => p.ParentId > 0).ToList();
            foreach (var model in parents)
            {
                EquTypeTree pt = new EquTypeTree();
                pt.title = model.EName;
                pt.isLeaf = false;
                pt.expanded = true;
                pt.key = model.IId;
                pt.ParentId = model.ParentId;
                result.Add(pt);
                AddMenu(childrens, pt, model.IId);
            }

     public BaseResultT<EquTypeCKTree> CKTree()
        {
            BaseResultT<EquTypeCKTree> fResult = new BaseResultT<EquTypeCKTree>();
            fResult.DataContent = new List<EquTypeCKTree>();
            List<EquTypeCKTree> result = new List<EquTypeCKTree>();
            var list = db.Equ_Type.Where(p => p.Status == 1).ToList();

            List<Equ_Type> parents = new List<Equ_Type>();
            List<Equ_Type> childrens = new List<Equ_Type>();
            parents = list.Where(p => p.ParentId == 0 || p.ParentId == null).ToList();
            childrens = list.Where(p => p.ParentId > 0).ToList();
            foreach (var model in parents)
            {
                EquTypeCKTree pt = new EquTypeCKTree();
                pt.label = model.EName;
                pt.Prefix = model.Prefix1;