Search:
Login
datastructure_and_algorithms
RecentChanges
FindPage
HelpContents
datastructu..._algorithms
Immutable Page
Comments
Info
Attachments
More Actions:
Raw Text
Print View
Render as Docbook
Delete Cache
------------------------
Check Spelling
Like Pages
Local Site Map
------------------------
Rename Page
Delete Page
------------------------
Subscribe User
------------------------
Remove Spam
Revert to this revision
Package Pages
Sync Pages
------------------------
Load
Save
SlideShow
堆栈(包括递归依赖的系统堆栈)用来实现深度优先
队列用来实现广度优先
算法时间复杂度分析,关键在于两个工具:加法规则、乘法规则。就是概率统计里的那两个规则。乘法规则针对循环嵌套。
对BST来说,中序遍历是最有用的一种。因为BST的中序遍历序列中,等值节点会连续排列,在很多应用场景中可以利用这点性质。
datastructure_and_algorithms (last edited 2021-07-03 12:22:18 by
zbjxb
)