递归循环（多层找位置id）

用递归实现找到父元素的ID，任意位置找父元素

好难啊，循环找到。

[

{

"Id" : 59,

"ParentId" : 0,

"nodetype" : "Org",

"TmplTypeId" : 1,

"Name" : "DEL",

"DisplayName" : "DEL",

"Lev" : 1,

"Logo" : "1",

"Children" : []

},

{

"Id" : 63,

"ParentId" : 0,

"nodetype" : "Org",

"TmplTypeId" : 1,

"Name" : "LLLLL",

"DisplayName" : "LLLLL",

"Lev" : 1,

"Logo" : "1",

"Children" : [

{

"Id" : 77,

"ParentId" : 63,

"nodetype" : "Org",

"TmplTypeId" : 1,

"Name" : "ttt",

"DisplayName" : "ttt",

"Lev" : 2,

"Logo" : "2",

"Children" : []

}

]

},

{

"Id" : 65,

"ParentId" : 0,

"nodetype" : "Org",

"TmplTypeId" : 1,

"Name" : "MMM",

"DisplayName" : "MMM",

"Lev" : 1,

"Logo" : "2",

"Children" : []

},

{

"Id" : 1,

"ParentId"