一区二区久久-一区二区三区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實現二叉樹,轉載需保留來源!

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

主站蜘蛛池模板: 婷婷丁香九月 | 国产综合第一页 | 亚洲午夜视频在线 | 亚洲欧美成人 | 亚洲无吗视频 | 高清一区二区三区四区五区 | 久久综合中文字幕 | 久久精品中文字幕久久 | 性欧美xxxx视频在线观看 | 最新福利小视频在线播放 | 国内自拍经典三级在线 | 九九九网站 | 欧美网站在线 | 国产久热香蕉在线观看 | r18在线观看| 夜色1网站 | 精品国产一区二区三区免费 | 欧美色域 | 亚欧色视频在线观看免费 | 亚洲一区二区福利视频 | 99爱视频99爱在线观看免费 | 一级一级女人18毛片 | 亚洲狠狠| 久久永久免费视频 | 国产高清在线视频 | 亚洲福利视频一区二区三区 | 国产精品免费视频播放 | 欧美日韩一区二区三区自拍 | 亚洲精品影院 | 大色香蕉 | 日韩美女va毛片在线播放 | 久久黄色大片 | 中文字幕热久久久久久久 | 亚洲综合久久伊人热 | 伊人国产在线播放 | 91成品视频 | 亚洲一区在线播放 | 精品久久中文久久久 | 一区二区中文字幕 | 国产成人涩涩涩视频在线观看 | 久久91精品国产91 |