这篇文章主要为大家展示了“PHP如何实现二叉树”，内容简而易懂，条理清晰，希望能够帮助大家解决疑惑，下面让小编带领大家一起研究并学习一下“PHP如何实现二叉树”这篇文章吧。
成都创新互联是一家专注于成都网站建设、
成都做网站与策划设计,上高网站建设哪家好?
成都创新互联做网站,专注于网站建设十年,网设计领域的专业建站公司;建站业务涵盖:上高等地区。上高做网站价格咨询:028-86922220
二叉树及其变体是数据结构家族里的重要组成部分。最为链表的一种变体，二叉树最适合处理需要一特定次序快速组织和检索的数据。
// 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 '
', implode(', ', $tree->traversePreorder()), '
';
// Post-order: h, 9, 6, a, 3
echo '', implode(', ', $tree->traversePostorder()), '
';
// In-order: h, 3, 6, 9, a
echo '', implode(', ', $tree->traverseInorder()), '
';
?>
以上是“PHP如何实现二叉树”这篇文章的所有内容，感谢各位的阅读！相信大家都有了一定的了解，希望分享的内容对大家有所帮助，如果还想学习更多知识，欢迎关注创新互联行业资讯频道！
当前文章：PHP如何实现二叉树-创新互联
浏览路径：
http://cdkjz.cn/article/dhjici.html
