class Node
{
int m_nVal;
Node* m_pLeftNode;
Node* m_pRightNode;
};
1.create 2.由小到大遍巡並列出值 3.由大到小遍巡並列出值 4. 由最根處從上而下、從左至右列出值 5.search 6. 總節點數
Class Node: m_pLeftNode存放比nVal還小的的Node,m_pRightNode存放比nVal還大的Node
-
Notifications
You must be signed in to change notification settings - Fork 0
gorange310/BST
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published