一区二区久久-一区二区三区www-一区二区三区久久-一区二区三区久久精品-麻豆国产一区二区在线观看-麻豆国产视频

PHP Class&Object -- 解析PHP實現二叉樹

二叉樹及其變體是數據結構家族里的重要組成部分。最為鏈表的一種變體,二叉樹最適合處理需要一特定次序快速組織和檢索的數據。
復制代碼 代碼如下:
<?php
// Define a class to implement a binary tree
class Binary_Tree_Node {
    // Define the variable to hold our data:
    public $data;
    // And a variable to hold the left and right objects:
    public $left;
    public $right;

    // A constructor method that allows for data to be passed in
    public function __construct($d = NULL) {
        $this->data = $d;
    }

    // Traverse the tree, left to right, in pre-order, returning an array
    // Preorder means that each node's value preceeds its children.
    public function traversePreorder() {
        // Prep some variables.
        $l = array();
        $r = array();
        // Read in the left and right children appropriately traversed:
        if ($this->left) { $l = $this->left->traversePreorder(); }
        if ($this->right) { $r = $this->right->traversePreorder(); }

        // Return a merged array of the current value, left, and right:
        return array_merge(array($this->data), $l, $r);
    }
    // Traverse the tree, left to right, in postorder, returning an array
    // Postorder means that each node's value follows its children.
    public function traversePostorder() {
        // Prep some variables.
        $l = array();
        $r = array();
        // Read in the left and right children appropriately traversed:
        if ($this->left) { $l = $this->left->traversePostorder(); }
        if ($this->right) { $r = $this->right->traversePostorder(); }

        // Return a merged array of the current value, left, and right:
        return array_merge($l, $r, array($this->data));
    }
    // Traverse the tree, left to right, in-order, returning an array.
    // In-order means that values are ordered as left children, then the
    //  node value, then the right children.
    public function traverseInorder() {
        // Prep some variables.
        $l = array();
        $r = array();
        // Read in the left and right children appropriately traversed:
        if ($this->left) { $l = $this->left->traverseInorder(); }
        if ($this->right) { $r = $this->right->traverseInorder(); }

        // Return a merged array of the current value, left, and right:
        return array_merge($l, array($this->data), $r);
    }
}
// Let's create a binary tree that will equal the following:    3
//                                                             / /     
//                                                            h   9     
//                                                               / /    
// Create the tree:                                             6   a   
$tree = new Binary_Tree_Node(3);
$tree->left = new Binary_Tree_Node('h');
$tree->right = new Binary_Tree_Node(9);
$tree->right->left = new Binary_Tree_Node(6);
$tree->right->right = new Binary_Tree_Node('a');
// Now traverse this tree in all possible orders and display the results:
// Pre-order: 3, h, 9, 6, a
echo '<p>', implode(', ', $tree->traversePreorder()), '</p>';
// Post-order: h, 9, 6, a, 3
echo '<p>', implode(', ', $tree->traversePostorder()), '</p>';
// In-order: h, 3, 6, 9, a
echo '<p>', implode(', ', $tree->traverseInorder()), '</p>';
?>

php技術PHP Class&amp;amp;Object -- 解析PHP實現二叉樹,轉載需保留來源!

鄭重聲明:本文版權歸原作者所有,轉載文章僅為傳播更多信息之目的,如作者信息標記有誤,請第一時間聯系我們修改或刪除,多謝。

主站蜘蛛池模板: 国产精品久久1024 | 91视频麻豆 | 久久精品全国免费观看国产 | 国模人体aⅴ | 亚洲福利一区二区三区 | 亚洲福利一区二区三区 | 亚洲二区视频 | 欧美黑人巨大xxxxxxxx | 国内一区二区三区精品视频 | 亚洲午夜大片 | 91免费视频观看 | 成人sq视频在线观看网站 | 色天天综合| 精品久久久99大香线蕉 | 91福利国产在线观看一区二区 | 操亚洲 | 日本一区二区三区久久 | 久久免费视频8 | 成人精品视频一区二区三区 | 成人免费精品视频 | 91aaa在线观看 | 免费一级做a爰片性色毛片 免费一看一级毛片人 | 天堂一区二区三区精品 | 国产91剧情| 四虎永久免费地址在线观看 | 久久97久久97精品免视看清纯 | 国产成人91激情在线播放 | 久久国产精品国产精品 | 特级xxxxx欧美 | 国产精品青草久久福利不卡 | 欧美在线网址 | 欧洲综合色| 国产系列 视频二区 | 欧美精品亚洲精品日韩专区 | 日韩三级 | 在线视频第二页 | www.最色| 香港三级欧美国产精品 | 精品国产自在现线久久 | yiren综合| 亚洲国产激情一区二区三区 |