|
树
0.1
数据结构_第6章
|
二叉链表的结点类 More...
Public Member Functions | |
| BinNode (const value_type &_data=value_type{}, BinNode *_left=nullptr, BinNode *_right=nullptr) | |
| Construct a new Bin Node object. More... | |
| BinNode (value_type &&_data, BinNode *_left, BinNode *_right) | |
| Construct a new Bin Node object. More... | |
| ~BinNode ()=default | |
| Destroy the Bin Node object. More... | |
Public Attributes | |
| value_type | data |
| 数据 More... | |
| BinNode * | left |
| 指向左child More... | |
| BinNode * | right |
| 指向右child More... | |
二叉链表的结点类
Definition at line 120 of file binaryTree.hh.
|
inlineexplicit |
Construct a new Bin Node object.
| _data | 数据 |
| _left | 左child的地址 |
| _right | 右child的地址 |
Definition at line 133 of file binaryTree.hh.
|
inlineexplicit |
Construct a new Bin Node object.
| _data | 数据 |
| _left | 左child的地址 |
| _right | 右child的地址 |
Definition at line 142 of file binaryTree.hh.
|
default |
Destroy the Bin Node object.
| value_type Tree::binaryTree< T, Comparator >::BinNode::data |
数据
Definition at line 122 of file binaryTree.hh.
Referenced by Tree::binaryTree< T, Comparator >::clear().
| BinNode* Tree::binaryTree< T, Comparator >::BinNode::left |
指向左child
Definition at line 123 of file binaryTree.hh.
Referenced by Tree::binaryTree< T, Comparator >::clear(), and Tree::binaryTree< T, Comparator >::isCompleteTree().
| BinNode* Tree::binaryTree< T, Comparator >::BinNode::right |
指向右child
Definition at line 124 of file binaryTree.hh.
Referenced by Tree::binaryTree< T, Comparator >::clear(), and Tree::binaryTree< T, Comparator >::isCompleteTree().