PHP Class&Object -- PHP 自排序二叉樹

在節點之間再應用一些排序邏輯，二叉樹就能提供出色的組織方式。對於每個節點，都讓滿足所有特定條件的元素都位於左節點及其子節點。在插入新元素時，我們需要從樹的第一個節 點(根節點)開始，判斷它屬於哪一側的節點，然後沿着這一側找到恰當的位置，類似地，在讀取數據時，只需要使用按序遍歷方法來遍歷二叉樹。

 <?php ob_start(); // Here we need to include the binary tree class Class Binary_Tree_Node() { // You can find the details at //http://blog.csdn.net/dengzonghuan/archive/2009/03/17/3999372.aspx } ob_end_clean(); // Define a class to implement self sorting binary tree class Sorting_Tree { // Define the variable to hold our tree: public $tree; // We need a method that will allow for inserts that automatically place // themselves in the proper order in the tree public function insert($val) { // Handle the first case: if (!(isset($this->tree))) { $this->tree = new Binary_Tree_Node($val); } else { // In all other cases: // Start a pointer that looks at the current tree top: $pointer = $this->tree; // Iteratively search the tree for the right place: for(;;) { // If this value is less than, or equal to the current data: if ($val <= $pointer->data) { // We are looking to the left ... If the child exists: if ($pointer->left) { // Traverse deeper: $pointer = $pointer->left; } else { // Found the new spot: insert the new element here: $pointer->left = new Binary_Tree_Node($val); break; } } else { // We are looking to the right ... If the child exists: if ($pointer->right) { // Traverse deeper: $pointer = $pointer->right; } else { // Found the new spot: insert the new element here: $pointer->right = new Binary_Tree_Node($val); break; } } } } } // Now create a method to return the sorted values of this tree. // All it entails is using the in-order traversal, which will now // give us the proper sorted order. public function returnSorted() { return $this->tree->traverseInorder(); } } // Declare a new sorting tree: $sort_as_you_go = new Sorting_Tree(); // Let's randomly create 20 numbers, inserting them as we go: for ($i = 0; $i < 20; $i++) { $sort_as_you_go->insert(rand(1,100)); } // Now echo the tree out, using in-order traversal, and it will be sorted: // Example: 1, 2, 11, 18, 22, 26, 32, 32, 34, 43, 46, 47, 47, 53, 60, 71, // 75, 84, 86, 90 echo '<p>', implode(', ', $sort_as_you_go->returnSorted()), '</p>'; ?>