|
|
在计算机科学中，二叉树是每个结点最多有两个子树的有序树。通常子树的根被称作“左子树”（left subtree）和“右子树”（right subtree）。二叉树常被用作二叉查找树和二叉堆。
In computer science, binary tree each node has at most two subtrees ordered tree. Root of the subtree is usually referred to as "left subtree" (left subtree) and "right subtree" (right subtree). Binary tree is often used as a binary search tree and binary heap.
|
|
Source link has yet to be found. Please, try to download it from local website.
|
从本站下载附件及源代码 (1个附件，已经成功下载1次)
|
|
|