Join the social network of Tech Nerds, increase skill rank, get work, manage projects...
 

  • How to make UL/LI tree from a normal array

    @lalit.singh
    Recommendations Offline Message

    • 0
    • 1
    • 1
    • 2
    • 0
    • 0
    • 0
    • 0
    • 257
    Comment on it

    We usally wants to male a ul/li tree from an array having parent id within each individual record :

    1. $subjecttopic=Array
    2. (
    3.     [0] => Array
    4.         (
    5.             [id] => 52b28146f484a5a410000029
    6.             [name] => Addtion
    7.             [parent] => 0
    8.             [updated] => 2013-12-23 09:37:43
    9.         )
    10.     [1] => Array
    11.         (
    12.             [id] => 52b28150f484a5a41000002a
    13.             [name] => Subtraction
    14.             [parent] => 0
    15.             [updated] => 2013-12-23 09:37:49
    16.         )
    17.     [2] => Array
    18.         (
    19.  
    20.             [id] => 52b281c2f484a59c1000002f
    21.             [name] => 2 Digit Simple Addition
    22.             [parent] => 52b28184f484a59c1000002b
    23.             [updated] => 2013-12-23 09:37:26
    24.         )
    25.     [3] => Array
    26.         (
    27.  
    28.             [id] => 52b281c9f484a59c10000030
    29.             [name] => 3 Digit Simple Addition
    30.             [parent] => 52b28189f484a59c1000002c
    31.             [updated] => 2013-12-23 09:37:58
    32.         )
    33.     [4] => Array
    34.         (
    35.  
    36.             [id] => 52b281d4f484a59c10000031
    37.             [name] => 3 Digit Carry Addition
    38.             [parent] => 52b28189f484a59c1000002c
    39.             [updated] => 2013-12-23 09:38:06
    40.         )
    41.     [5] => Array
    42.         (
    43.  
    44.             [id] => 52b281a6f484a59c1000002d
    45.             [name] => 2 Digit Subtraction
    46.             [parent] => 52b28150f484a5a41000002a
    47.             [updated] => 2013-12-23 09:38:16
    48.         )
    49.     [6] => Array
    50.         (
    51.  
    52.             [id] => 52b28210f484a5cc1000002a
    53.             [name] => 2 Digit Borrow Subtraction
    54.             [parent] => 52b281a6f484a59c1000002d
    55.             [updated] => 2013-12-23 09:38:49
    56.         )
    57.     [7] => Array
    58.         (
    59.  
    60.             [id] => 52b28218f484a5cc1000002b
    61.             [name] => 3 Digit Borrow Subtraction
    62.             [parent] => 52b281abf484a59c1000002e
    63.             [updated] => 2013-12-23 09:38:54
    64.         )
    65.     [8] => Array
    66.         (
    67.  
    68.             [id] => 52b281abf484a59c1000002e
    69.             [name] => 3 Digit Subtraction
    70.             [parent] => 52b28150f484a5a41000002a
    71.             [updated] => 2013-12-23 09:38:59
    72.         )
    73.     [9] => Array
    74.         (
    75.  
    76.             [id] => 52b2821ff484a5cc1000002c
    77.             [name] => 3 Digit Simple Subtraction
    78.             [parent] => 52b281abf484a59c1000002e
    79.             [updated] => 2013-12-23 09:39:04
    80.         )
    81.     [10] => Array
    82.         (
    83.  
    84.             [id] => 52b28189f484a59c1000002c
    85.             [name] => 3 Digit Addition
    86.             [parent] => 52b28146f484a5a410000029
    87.             [updated] => 2013-12-23 09:40:24
    88.         )
    89.     [11] => Array
    90.         (
    91.  
    92.             [id] => 52b281dbf484a59c10000032
    93.             [name] => 2 Digit Carry Addition
    94.             [parent] => 52b28184f484a59c1000002b
    95.             [updated] => 2013-12-23 09:40:41
    96.         )
    97.     [12] => Array
    98.         (
    99.             [id] => 52b28184f484a59c1000002b
    100.             [name] => 2 Digit Addition
    101.             [parent] => 52b28146f484a5a410000029
    102.             [updated] => 2013-12-23 09:40:56
    103.         )
    104.     [13] => Array
    105.         (
    106.             [id] => 52b28208f484a5cc10000029
    107.             [name] => 2 Digit Simple Subtraction
    108.             [parent] => 52b281a6f484a59c1000002d
    109.             [updated] => 2013-12-23 09:41:01
    110.         )
    111. )
    1. public function buildTopicTree($rows, $parent = 0) {
    2.         $result = "
        ";
      •         foreach ($rows as $row) {
      •             if ($row['parent'] == $parent) {
      •                 if (count($row['children']) > 0){
      •                     $result.= "
      • {$row['name']}";
      •                     $result.= $this->buildTopicTree($rows,$row[_id]->{'$id'});
      •                 }else{
      •                     $result.= "
      • {$row['name']}";
      •                     $result.= $this->buildTopicTree($rows,$row[_id]->{'$id'});
      •                 }
      •                     $result.= "
        • ";
      •             }
      •         }
      •         $result.= "
      ";
    3.         return $result;
    4. }
    5.  
    6.  $resultstr=$this->buildTopicTree($subjecttopic);
    php recursive tree
    Comment on it

 0 Comment(s)

Sign In
Forgot Password?
                           OR                           
Create an account !!
                           OR                           
Register

Sign up using

                           OR                           
Forgot Password
Reset Password
Fill out the form below and reset your password: