PHP - N Level Tree Traversing

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 display binary tree  level wise. Breadth-first tree traversal can be used in it.Can anyone point me towards its logic or point me towards a good tutorial.

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]

Hey guys, I have a bunch of categories and products in a tree format. For several reasons I need to restructure them from the tree format into a flattened format.

I have 2 arrays, one full of categories, the other products. Each category and product has an ID, and a reference to it's parent's ID. The top level categories reference to 0.

What I need is to have the categories output like thus:

Top Level Categories:
  Category 1
  Category 2

Category 1
  Sub category 1
  Sub category 2

Category 2
  Sub category 3
  Sub category 4

Sub category 1
  Product 1
  Product 2

Sub category 2
  Product 3
  Product 4

Sub category 3
  Product 5
  Product 6

Sub category 4
  Product 7
  Product 8

There could be an unlimited number of sub categories within categories before we get to products, so this needs to be done through a function, however I cannot for the life of me think how to do this. Initially I thought about using 2 arrays, a buffer of categories outputted, and a queue of categories to be outputted, but quickly realised that when I go more than 2 layers deep I can't keep track of the queue's properly.

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 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.

Hi everyone,

I have a file filled with categories (about 100K or so lines), each one by indentation (for illustration purposes, I added + instead).
Quote

Root
+ Category
++ File 1
+++ Sub Cat
++++ File 4
++++ File 5
++ File 2
+ Category 2
++ SubCategory 1
+++ File 1
++ SubCategory 2



What am trying to is upload this file, and have it input into my table so jsTree can render it correctly. It correctly inserts most of the lines, but starts to get confused when reverting back to previous lines (in the above example, it will insert up to file 5 correctly, then get lost on the left/right on File 2.)

Am using jsTree's create_node, but not sure why the render is failing? My (rather brute-force) upload script is below:

Code: [Select]

$dataFile = fopen($file_dir . basename($_FILES['uploaded']['name']), "rb"); 
    while (!feof($dataFile))
    {
      $lines = array();

      while (($line = fgets($dataFile)) !== false)
      {
        array_push($lines, rtrim($line));
      }

      $count = count($lines);
      $res = preg_replace('/\t/i', "|", $lines);
      $final = preg_replace("/\s(\W)[^\w]/i", "|", $res);
         
      $i = 0;
      foreach($final as $string)
      {
        //$parent_id = $delimiter_count - 1;
        $delimiter_count = substr_count($string, '|'); //level
        $left = $i + 1;
        $right = $left + 1;
        preg_match("/(\|+)(\w.+)/i", $string, $match);
        if(isset($match[2]))
        {
       
        /* even this doesn't work, if I directly inject it into the tree
          $insert = $keysdb->query("INSERT INTO tree (`parent_id`, `position`, `left`, `right`, `level`, `title`, `type`, `post_syn_epon`, `post_author_id`)
          VALUES('$delimiter_count',0,'$left','$right','$delimiter_count','$match[2]','default','$match[2], ','user_id')");
    */
   
$jstree->create_node(array(
"id" => "$delimiter_count",
"position" => 0,
"title" => "$match[2]",
"type" => "default"
));
       
          if(!$insert) {
            print "Failed!" . $keysdb->error;
          }
        }
      $i++;
    }
  }   
//  all done  close the file
   fclose($dataFile);

hello !

I need a PHP script for my site ;

I need a script like this for my family tree site ;







Thank  you!

Hello

I have an array that I would like to display as a family tree... and am looking for an example script that will allow me to do this.

I want to be able to create X number of generations and fill the boxes with data from my array....

So, if I want 5 generations I want to generate a tree with 63 elements or boxes

Any help would be appreciated

Thanks

I'm working on adding a threaded comment system to a website. The comments will be in reply to posts which are part of a post table. The comment table contains an auto incremented ID, a ThreadID that references the post its replying to and a CommentID that references which comment its replying to if it is a reply to a comment and is null if its a reply directly to the post. It also contains the comment obviously. I can get all the comments for a post and push each comment object into an array and return it to be displayed.
What I'm stuck on though is having the comments nested. Any idea's I've came up with fall short of being able to be n level trees.
I'm sure the answer is something to do with recursion but I can't think of how it would be implemented in this case.
Any help or pointers would be great. I'm reading around but I thought I'd stop in here and ask as well.
Thanks in advance.

hi guys.

i want to implement a referral system. a member can only refer using a form in the memebers area. on the referral form, i have a hidden field which is his referral id and a unique code (md5 generated link) and a field for the email address he wants to refer. once he sends the mail, a referal link (md5 generated, for uniqueness and to curb cheating) is sent to the email so that once he clicks, it takes him/her to the registration area.


on my database table

referrer_uid - the unique id of person referring someone
referred_uid - the unique id of person being referred
ref_code - the md5 generated code which is used on the link sent
referred_email - the email address of the person being referred
status - once a member sends a refer link, status is set to Referal sent
date_referred - the date the refering took place
date_accepted - the day the referred was accepted (i dont want this to change on clicking a referal link or registration cos not everyone gets accepted to avoid spurious referals)


my question is how do i create a traversal tree with this. i read about traversal tree on sitepoint but when i tried to implement the examples, it didnt work for me and i noticed it was an old post.

note: i intend giving points based on the child/tree and it could be as deep as possible. also if my method is wrong, ideas are higly appreciated.

thanks
 

Hello, I am currently working on a multi level marketing system requiring  a lot of special features than the regular. It has 7 different levels with which you have move to the next level as your downlines qualify for the previous levels respectively. I am quite stuck on the tree structure. Here is how the plan details

**1st stage** is 3 direct downlines only 

**2nd stage** 9 people from the direct 3 should qualify for 1st stage making total of  30, that mean 3 from 1st leg,3 from 2nd leg ,3 from 3 leg 

**stage 3** ,9 people from the 30 should qualify for 2nd stage and it should fall on the direct 3
That means 3 from 1st leg ,3 from 2nd leg, 3 from 3rd leg that means the **direct 3** it self then 2,2 members from them again so each will get 3 from it side to make the person qualify so in total 
9x30+30 making 300

**Stage 3** 
12 people from the 300 who has qualify for **stage 3**
4 from 1st leg ,4 from 2nd leg 4 from 3rd leg 
This people should include the direct 3 before the person can qualify
So it continues

I need help with these first three functions and I will work the rest out. Building a separate tree view for each of the stages. Thanks

Evening everyone and Merry X-Mas (Happy Holidays) or whatever fits you best....   I have been trying over and over for about 12 hours to figure out how to get data from a specific JSON response and assign the specific values to a new array key/value pair. The various ways I have tried to figure this out are  numerous so i'm going to avoid the runnig list of "I trieid this...and this...and this... etc etc." just understand I have reached a dead end point where I need help badly.   Here is what our end goal is:   "The company" is a "service industry" provider (plumbing, electrical etc. etc.) who wants to dispatch its technicians to new jobs based on which technician has the shortest travel time from any existing address where they already have a scheduled appointment that day and has available time in there schedule. Thus the dispatching system when a new service call is entered is going to give "recommended" technicians (up to 4) to be assigned the new service call based on the above mentioned criteria. (Efficient routing to save company gas cost)   1.) We have a "New service" street address assigned to the $to variable: $to = "4813 River Basin Dr S, Jacksonville FL 32207";
    2.) We will have "records" array which containes a series of records, each record consists of a ticket# a technician id# and a street address: $records = array(
array("DV1012","30453423","9890 Hutchinson Park Dr Jacksonville, FL 32225"),
array("DB3434","30404041","821 Orange Ave Crescent City, FL 32112"),
array("DB3434","30605060","1972 Wells Road, Orange Park FL 32073"),
array("DB4578","30605060","2 Independent Drive, Jacksonville FL 32202"),
array("DB7841","30605060","5000 Norwood Avenue, Jacksonville FL 32208"),
array("DB3235","30605060","9501 Arlington Expressway, Jacksonville FL 32225"),
array("DB7894","30605060","Massey Avenue, Jacksonville, FL 32227"),
array("DB2020","30121212","11200 Central Pkwy Jacksonville, FL 32224")
                );   3.) We are going to prepare the records array for submission to Google's Distance Matrix API by URL encoding each array value into a single variable and then submit it:   foreach ($records as $key => $value) {$from = $from.urlencode($value[2])."|";} $to = urlencode($to);
$data = file_get_contents("//maps.googleapis.com/maps/api/distancematrix/json?origins=$from&destinations=$to&language=en-EN&units=imperial&mode=driving&sensor=false");
$res=json_decode($data) or die("Error: Cannot read object");
  You may look at the ACTUAL live Google response from this he http://tiny.cc/i6eerx  (We have applied <pre> and var_dump($res) to the output)   We are looking to get the following information back: The distance and travel time between the "New Service" address ($to) and each of the address' in the $records array ($from), now once that information is returned from Google (JSON response) we need to parse the response and narrow it down to 4 or less (Based on the 4 lowest drive times) to form a new array which ends like this:   $results = array(
array("DV1012","30453423","2.3 Miles","8 mins"),
array("DB3434","30404041","2.8 Miles","9 mins"),
array("DB3434","30605060","4.6 Miles","13.8 mins"),
array("DB4578","30605060","5.7 Miles","15.2 min")
                ); OUR PROBLEM: Everything up until the the Google API response is fine, but iterating over the multidimensional arrays within multidimensional arrays of the JSON response is just not coming together in my head (or 2 dozen code attempts). I am able to ECHO an individual value like ( echo $res->rows[0]->elements[0]->distance->text; ) but this has no value for the end result i need to get to. My last thoughts and efforts was that that I was going to have to embed foreach statements within foreach statements to drill down through the various arrays but that hasn't worked very well and it seems like it shouldn't be how it has to be done. I would appreciate any help in showing me how the iteration code should be written and any explanation about the code so i can wrap my head around it.

I would like to adding a node to a tree. I want it to be a balanced b-tree. The logic/algorithm i can think of is

Code: [Select]
<?php
function add_node($root, $node) // Where $root is the parent to which node should be added and $node is the node that is to be added.
{
     Traverse the tree level wise, level 1 being the lchild and rchild of $root and calculate the number of node in that level
     if(number of nodes in a level < 2[sup]$level[/sup])  // Since number of nodes a level can accommodate  = 2[sup]$level[/sup] 
     {
          Add node in that level where ever it gets an empty spot.
     }
}
?>

Tree table:-
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;
Is their any better logic to do so ?