代码搜索:BinaryTree
找到约 1,360 项符合「BinaryTree」的源代码
代码结果 1,360
www.eeworm.com/read/298538/7951826
h bintree.h
#define NULL 0
#define Max(x1,x2) (x1>x2?x1:x2)
#include
template class BinaryTree;
template class BinTreeNode{
friend class BinaryTree;
pub
www.eeworm.com/read/197407/7997331
h compare.h
// function to compare two binary trees included
#ifndef BinaryTree_
#define BinaryTree_
int _count;
#include
#include "lqueue.h"
#include "btnode2.h"
#include "xcept.h"
te
www.eeworm.com/read/197407/7997631
h binary.h
// file binary.h
#ifndef BinaryTree_
#define BinaryTree_
int _count;
#include
#include "lqueue.h"
#include "btnode2.h"
#include "xcept.h"
template class B
www.eeworm.com/read/197407/7997918
h ebinary.h
// Binary tree with DeepestElement included
#ifndef BinaryTree_
#define BinaryTree_
int _count;
#include
#include "lqueue.h"
#include "btnode2.h"
#include "xcept.h"
#incl
www.eeworm.com/read/197407/7997937
h bbinary.h
// Binary tree with SwapChildren included
#ifndef BinaryTree_
#define BinaryTree_
int _count;
#include
#include "lqueue.h"
#include "btnode2.h"
#include "xcept.h"
#include
www.eeworm.com/read/197407/7998051
h btnode2.h
#ifndef BinaryTreeNode_
#define BinaryTreeNode_
template class BinaryTree;
template class IndexedBinaryTree;
template class BSTree;
template
www.eeworm.com/read/197407/7998613
h dbinary.h
// binary tree class with root a protected member
// instead of a private member
#ifndef BinaryTree_
#define BinaryTree_
int _count;
#include
#include "lqueue.h"
#include "btn
www.eeworm.com/read/397389/8053371
cpp 二叉树建立与遍历.cpp
//程序用法:本程序二叉树的构造过程采用广义表作为输入,预先把节点信息以广义表字符串形式存储在文本
//文件中,程序运行首先从文件中读出节点信息构造二叉树。
//注意:文件中每一个字母代表一个节点元素值;
// 每个根结点作为由子树构成的表的名字放在前面;
// 每个结点的左孩子与右孩子用逗号隔开,若只有右孩子而无左孩子,逗号不能省略;
// 整个广义表以@ ...
www.eeworm.com/read/332549/12748439
cpp main.cpp
#include"BinaryTree.cpp"
#include
#include
BinaryTree Btree;
BinaryTreeNode *tnode;
void main()
{
int size;
int Tree[15]={0};
//int sum;
cout
www.eeworm.com/read/332462/12756556
cpp shujujiegou.cpp
#include "iostream"
using namespace std;
template class BinaryTree; //二叉树类BinaryTree的向前说明
template class BinaryNode //二叉树结点类
{
f