We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
哈希表使用hash function來對輸入的數據分配index到哈希表對應的槽中。假設有一個哈希表的size是100,而我們輸入的數據是從0~99,我們要把輸入數據儲存到哈希表中。理論上來說,該哈希表插入和查找操作的時間複雜度都是O(1)。
二叉樹遵循右子樹大於根節點,左子樹小於根節點的原則進行數據的插入和保存。如果這個樹的平衡的,那麼,對於每個元素的插入和查找操作的時間複雜度是O(log(n)),n是樹的節點個數,log(n)通常是樹的深度。當然,對於不平衡的情況,那就需要更複雜的數據結構的樹(紅黑樹等)進行處理。
特色
The text was updated successfully, but these errors were encountered:
No branches or pull requests
哈希表
哈希表使用hash function來對輸入的數據分配index到哈希表對應的槽中。假設有一個哈希表的size是100,而我們輸入的數據是從0~99,我們要把輸入數據儲存到哈希表中。理論上來說,該哈希表插入和查找操作的時間複雜度都是O(1)。
二叉树
二叉樹遵循右子樹大於根節點,左子樹小於根節點的原則進行數據的插入和保存。如果這個樹的平衡的,那麼,對於每個元素的插入和查找操作的時間複雜度是O(log(n)),n是樹的節點個數,log(n)通常是樹的深度。當然,對於不平衡的情況,那就需要更複雜的數據結構的樹(紅黑樹等)進行處理。
特色
二叉搜索树
特色
The text was updated successfully, but these errors were encountered: