Skip to main content

Binary Tree PHP

 <?php


class TreeNode {

    public $data;

    public $left;

    public $right;


    public function __construct($data) {

        $this->data = $data;

        $this->left = null;

        $this->right = null;

    }

}


$root = new TreeNode('R');

$nodeA = new TreeNode('A');

$nodeB = new TreeNode('B');

$nodeC = new TreeNode('C');

$nodeD = new TreeNode('D');

$nodeE = new TreeNode('E');

$nodeF = new TreeNode('F');

$nodeG = new TreeNode('G');


$root->left = $nodeA;

$root->right = $nodeB;


$nodeA->left = $nodeC;

$nodeA->right = $nodeD;


$nodeB->left = $nodeE;

$nodeB->right = $nodeF;


$nodeF->left = $nodeG;


// Test

echo "root->right->left->data: " . $root->right->left->data;


?>

..........................


<?php


class TreeNode {

    public $data;

    public $left;

    public $right;


    public function __construct($data) {

        $this->data = $data;

        $this->left = null;

        $this->right = null;

    }

}


function preOrderTraversal($node) {

    if ($node === null) {

        return;

    }

    echo $node->data . ", ";

    preOrderTraversal($node->left);

    preOrderTraversal($node->right);

}


$root = new TreeNode('R');

$nodeA = new TreeNode('A');

$nodeB = new TreeNode('B');

$nodeC = new TreeNode('C');

$nodeD = new TreeNode('D');

$nodeE = new TreeNode('E');

$nodeF = new TreeNode('F');

$nodeG = new TreeNode('G');


$root->left = $nodeA;

$root->right = $nodeB;


$nodeA->left = $nodeC;

$nodeA->right = $nodeD;


$nodeB->left = $nodeE;

$nodeB->right = $nodeF;


$nodeF->left = $nodeG;


// Traverse

preOrderTraversal($root);


?>


.................
<?php

class TreeNode {
    public $data;
    public $left;
    public $right;

    public function __construct($data) {
        $this->data = $data;
        $this->left = null;
        $this->right = null;
    }
}

function inOrderTraversal($node) {
    if ($node === null) {
        return;
    }
    inOrderTraversal($node->left);
    echo $node->data . ", ";
    inOrderTraversal($node->right);
}

$root = new TreeNode('R');
$nodeA = new TreeNode('A');
$nodeB = new TreeNode('B');
$nodeC = new TreeNode('C');
$nodeD = new TreeNode('D');
$nodeE = new TreeNode('E');
$nodeF = new TreeNode('F');
$nodeG = new TreeNode('G');

$root->left = $nodeA; 
$root->right = $nodeB;

$nodeA->left = $nodeC;
$nodeA->right = $nodeD;

$nodeB->left = $nodeE;
$nodeB->right = $nodeF;

$nodeF->left = $nodeG;

// Traverse
inOrderTraversal($root);

?>


Comments

Post a Comment

Popular posts from this blog

MySQL's ACID compliance

Mysql acid compliance ACID is an acronym that stands for four key properties of database transactions: Atomicity Ensures that a transaction is treated as a single, indivisible unit of work Either all operations within a transaction are completed successfully, or none are If any part of the transaction fails, the entire transaction is rolled back to its previous state Prevents partial updates that could leave the database in an inconsistent state Consistency Guarantees that a transaction brings the database from one valid state to another valid state All data written to the database must adhere to defined rules, constraints, cascades, triggers, and other database integrity mechanisms Ensures that any transaction will not break the database's predefined rules Isolation Determines how and when changes made by one transaction become visible to other transactions Prevents interference between concurrent transactions MySQL provides different isolation levels: Read Uncommitted Read Commit...
1 comment
Read more

PHP OOPs exercise - Basic Oops

  Here are key PHP OOP (Object-Oriented Programming) exercise questions with solutions: Basic Class and Object Exercise: // Create a simple bank account class class BankAccount {     private $accountNumber;     private $balance;     public function __construct($accountNumber, $initialBalance = 0) {         $this->accountNumber = $accountNumber;         $this->balance = $initialBalance;     }     public function deposit($amount) {         if ($amount > 0) {             $this->balance += $amount;             return true;         }         return false;  ...
Post a Comment
Read more

Interview questions for Senior PHP Developer particle41.com

1.Self Introduction 2.Basic questions on session and cookie. 3.Where is session stored? 4.Difference between Cookie and session. 5.Will there be any session before session start? 6.Post Max execution time.How can we modify it? 7.We have a string, "BJFSJK".Without any php function reverse it with half the string length.   To reverse the string with half the string length without using any PHP functions, you can implement a simple algorithm to achieve the desired result. Here's how you can do it: Initialize two pointers, one at the beginning of the string and the other at the midpoint of the string. Swap characters between these two pointers iteratively, moving the pointers towards each other until they meet or cross each other. Here's the PHP code to implement this algorithm:  <?php $string = "ABC100"; $length = strlen($string); // Calculate the midpoint of the string $midpoint = (int)($length / 2); // Initialize pointers $start = 0; $end = $length - 1; //...
Post a Comment
Read more