搜索资源列表
LevelOrderTraverse
- 在链式存储结构条件下实现层次遍历二叉树的各个节点的操作。-Storage structure in the chain under the conditions of the various node-level binary tree traversal operation.
treelinklist
- this code for tree linked list. you can create node. and then yo can look child of data from root.
090811451
- 求二叉树的高度与结点，判断两颗二叉树是否相识-Find the height and node binary tree, binary tree to determine whether the two met
NodeAssign
- 在链式结构存储条件下用结构体指针实现二叉树各个节点的修改操作。-Storage conditions in the chain structure pointers with a binary tree structure modification operations of each node.
zigbee-experimental-instruction
- FS_zigbee协议栈实验指导书，包括采集节点和传感节点的通信分析，开关节点和控制节点的通信分析，树状网络的通信分析，硬件电路和驱动分析-FS zigbee protocol stack experimental instruction, including collection node and a sensor node analysis of communication, switch node and control node of the communication analysis
MCU_SOC_LCD_Menu
- 最近收集的关于菜单的文章,都可以在单片机上实现，比如基于单片机的多级菜单实现方法，基于节点编号的通用树状菜单设计方法与实现等等，真心为网友提供方便，要好评呦，亲-Recently collected articles on the menu, can be implemented on the microcontroller, such as multi-level menu based on single chip implementation method, based on a commo
InOrderThreadBiTree-(2)
- 手动输入各个结点建立二叉树(递归) ,普通二叉树的先序和后序遍历(递归),中序线索化(递归), 线索二叉树的先序和中序遍历(递归),线索二叉树的中序遍历(非栈、非递归), 层次遍历(使用队列),销毁整棵二叉树(递归)-Manually enter each node to build a binary tree (recursively), common binary tree inorder and postorder traversal (recursive), the sequence
hefuman
- 赫夫曼树：试构造一棵有n个叶子结点的二叉树，每个叶子节点带权为wi，则期中带权路径wpl的最小的二叉树-Huffman Tree: test construct an n-leaf nodes are the binary tree, each leaf node with a right to wi, then the period of the right path with the smallest binary tree wpl
NetworkTopology-Tree
- zigbee，实现zigbee节点通过串口向上位机发送传感器收集到的数据，通sensor monitor查看节点之间的关系(ZigBee, the ZigBee node sends the data collected by the sensor through the serial port through the serial port, and looks through the relationship between the nodes through the sensor moni