PHP - Binary Tree Traversals

hi all.

I am working on a MLM project in which i have more than 30,000 members followed by the root member,i have to store member automatically in binary tree form like

1 is root
2 is child of 1
3 is child of 1

Then 4 is child of 2
5 is child of 2

and so on ......

i have to design database for that.

please help

I am trying to count left node of a binary tree.I made a function but my result is always 3 .

Code:-

Code: [Select]
<?php
  include'config.php';  // Connect database

  function leftcount($node)   //Function to calculate leftcount
  {
    $sql = "SELECT lchild,rchild FROM tree WHERE parent = '$node'";
    $execsql = mysql_query($sql);
    $array = mysql_fetch_array($execsql);
    
    if(!empty($array['lchild']))
    {
      $count++;
      leftcount($array['lchild']);  
    } 
    if(!empty($array['rchild']))
    {
       $count++;
       leftcount($array['rchild']); 
    }
    
    $totalcount = 1 + $count;
    return $totalcount;
    
  }
  
  $parent = "2";
  $left = leftcount($parent);
  echo $left;
  
?>
Can someone please point the error in my logic ? I searched google but i only got scripts with classes and i don't want to use classes.

Hey guys,
i am a college student and working on a project of mlm ad want to display the binary income tree,and also calculate the income that is given to each node.
Please see the attachments for the binary tree structure and database table structure.
Thanks.

[attachment deleted by admin]

This is my first try to display binary tree so please go easy on me.
I am trying to display binary tree using array. The values are stored in mysql.

Structure of mysql-
Code: [Select]
CREATE TABLE IF NOT EXISTS `tree` (
  `parent` int(7) NOT NULL,
  `rchild` int(7) NOT NULL,
  `lchild` int(7) NOT NULL
) ENGINE=InnoDB DEFAULT CHARSET=latin1;

Display should look like
Code: [Select]
                    1
              ______|______
             |             |
             2             3
                     ______|______
                    |             |
                    4              5   


My Code till now-
Code: [Select]
<?php
 include 'connection.php';
 $rsearch = "SELECT rchild FROM tree WHERE parent='".$parent."'";
 $lsearch = "SELECT lchild FROM tree WHERE parent='".$parent."'";
    
  $rexec = mysql_query($rsearch);
  $lexec = mysql_query($lsearch);
  
  while($rrow = mysql_fetch_assoc($rexec)) // Putting right branch in an array first
{
    $rtree[$i][0] = $rrow['parent'] ; 
    $rtree[$i][1] = $rrow['lchild'] ;
    $rtree[$i][2] = $rrow['rchild'] ;
    $i++;
}
while($lrow = mysql_fetch_assoc($lexec)) // Putting left branch in an array 
{
    $ltree[$j][0] = $lrow['parent'] ; 
    $ltree[$j][1] = $lrow['lchild'] ;
    $ltree[$j][2] = $lrow['rchild'] ;
    $j++;
}

function displaytree($parent,$array)
{
   // Im stuck here. Can someone please help me with it
}
?>
I am stuck at displaying the tree function. Can someone please point me in the right direction ?

I made a function to check if the child belongs to a parent ($node) or not. However its not working completely.If i include immediate children of the parent ($node) then the answer is yes otherwise it gives nothing (indicating it isnt the child) which is wrong. I think its because of recursive functions.Can someone please point out my mistake.

Code: [Select]
<?php
function ischild($node,$child)   //$node is parent to see if $child is its child or not.
  {
    $sql = "SELECT lchild,rchild FROM tree WHERE parent = '$node'";
    $execsql = mysql_query($sql);
    $array = mysql_fetch_array($execsql);
    
    if(($array['lchild']) == $child)
    {
   
      return "yes";
    }
    elseif (!empty($array['lchild']))
    {
        ischild($array['lchild'],$child);
    } 
    if($array['rchild'] == $child)
    {
        return "Yes";
    }
    elseif(!empty($array['rchild']))
    {
        ischild($array['rchild'],$child);
     }
   
  }