文件名称:Binary_Tree
介绍说明－－下载内容均来自于网络，请自行研究使用
二叉树是每个节点最多有两个子树的有序树。通常子树被称作“左子树”（left subtree）和“右子树”（right subtree）。二叉树常被用于实现二叉查找树和二叉堆。值得注意的是，二叉树不是树的特殊情形。在图论中，二叉树是一个连通的无环图，并且每一个顶点的度不大于3。-Each node in a binary tree is an ordered tree up to two sub-tree. Usually sub-tree is called " left sub-tree" (left subtree) and " right subtree" (right subtree). Binary tree is often used to implement a binary search tree and binary heap. Notably, the binary tree is not a special case. In graph theory, a binary tree is a connected acyclic graph, and the degree of each vertex is not more than 3.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
MyQueue.h
MyStack.cpp
MyStack.h
Record.cpp
Record.h
utility.h
Binary_node.cpp
Binary_node.h
Binary_tree.cpp
Binary_tree.h
Key.cpp
Key.h
Main.cpp
MyQueue.cpp