搜索资源列表
2-3-tree
- n computer science, a 2-3 tree is a type of data structure, a tree where every node with children (internal node) has either two children (2-node) and one data element or three children (3-nodes) and two data elements. Nodes on the outside of the tre
red
- n computer science, an AVL tree is a self-balancing binary search tree, and it was the first such data structure to be invented.[1] In an AVL tree, the heights of the two child subtrees of any node differ by at most one if at any time they differ by
tree-data
- In computer science, a tree is a widely used data structure that simulates a hierarchical tree structure with a set of linked nodes. A tree can be defined recursively (locally) as a collection of nodes (starting at a root node), where each node
bitree
- 构造一棵二叉树、释放二叉链表中各结点的存储空间、获取指向二叉树根结点的指针、前序遍历二叉树、中序遍历二叉树、后序遍历二叉树等的编程-Construct a binary tree, the release of storage space for each node in the binary list, access points to the binary tree root pointer, before traversing Binary inorder binary tree trav
An-Efficient-Tree-based-Power-Saving-Scheme-for-W
- Wireless sensor networks with mobile sink are ex-pected to increase the flexibility for gathering information in large-scale sensing and detecting environments. Energy saving becomes one of the most important features of the sensor nodes to extend th