Welcome![Sign In][Sign Up]
Location:
Search - aglo7

Search list

[ADO-ODBCaglo7-1

Description: 二叉树的基本算法。(1) 输出二叉树B; (2) 输出二叉树B的深度; (3) 输出H结点的左、右孩子结点值; (4) 输出二叉树B的宽度; (5) 输出二叉树B的结点个数; 输出二叉树B的叶子结点个数 -The basic algorithm for binary tree。(1) output binary tree B (2) The output of a binary tree B of depth (3) The output of H nodes left and right child node value (4) outputs a binary tree B, width (5) output node B, the number of binary trees Output binary tree B, the number of leaf nodes
Platform: | Size: 1024 | Author: xjj | Hits:

[Data structsaglo7

Description: (一) 编写一个程序LAGO7-1.CPP,实现二叉树的各种运算,并在此基础上设计一个主程序完成如下功能。 (1) 输出二叉树B; (2) 输出二叉树B的深度; (3) 输出H结点的左、右孩子结点值; (4) 输出二叉树B的宽度; (5) 输出二叉树B的结点个数; 输出二叉树B的叶子结点个数 -(A) to prepare a program LAGO7-1.CPP, to achieve a variety of binary operations, and on this basis, design a main program performs the following functions. (1) output binary tree B (2) The output of a binary tree B of depth (3) The output of H nodes left and right child node value (4) outputs a binary tree B, width (5) output node B, the number of binary trees (6) outputs a binary tree B, the number of leaf nodes
Platform: | Size: 2048 | Author: xjj | Hits:

CodeBus www.codebus.net