代码搜索:BinaryTree
找到约 1,360 项符合「BinaryTree」的源代码
代码结果 1,360
www.eeworm.com/read/249070/12523784
txt c10p531.txt
void BinaryTree::inorder(TreeNode *treePtr,
FunctionType visit)
{ if (treePtr != NULL)
{ inorder(treePtr->leftChildPtr, visit); // Point 1
visit(treePtr->item);
www.eeworm.com/read/249070/12523881
cpp example530.cpp
#include "BinaryTree.h" // binary tree operations
#include
using namespace std;
void display(TreeItemType& anItem);
int main()
{
BinaryTree tree1, tree2, left; // empty trees
Binar
www.eeworm.com/read/334825/12571281
cpp 01.cpp
#include
#include
#include
#include
templateclass BinaryTree;
templateclass BTreeNode
{
private:
BTreeNode*left;//左子数指针
www.eeworm.com/read/134950/13969742
cpp exp14_2.cpp
/*范例:从二叉排序树中删除一个结点。
[算法]
1) 被删除结点为叶结点,则只需修改其双亲结点对应指针为NULL,并释放该结点。
2) 被删结点只有左子树或右子树,此时只要将其左子树或右子树,直接成为其双亲结点的左或右子树。
3) 若被删结点K左右子树均不空,需循该结点的右子树根结点M的左子树,一直向左子树找,直到某结
点x的左子树为空,则把x的右子树改为其父结点的左子树,而用 ...
www.eeworm.com/read/235762/14053508
plg bt.plg
Build Log
--------------------Configuration: BT - Win32 Debug--------------------
Command Lines
Creating command line "rc.exe /l 0x804 /fo"Debu
www.eeworm.com/read/204469/15338909
cpp p170.cpp
#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/204469/15338992
cpp page170.cpp
#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/204469/15339001
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/201477/15407605
h btnode2.h
#ifndef BinaryTreeNode_
#define BinaryTreeNode_
template class BinaryTree;
template class BSTree;
template class DBSTree;
template
c
www.eeworm.com/read/201477/15407609
cpp huffman.cpp
// Huffman tree
#include
#include "minheap.h"
#include "binary.h"
#include "huffman.h"
template
BinaryTree HuffmanTree(T a[], int n)
{// Generate Huffman tree wi