Switch to English Site

dotsdots

Data Structures and Algorithms (III)

描述

By learning this course, you will get a comprehensive grasp of hashing and typical balanced binary search trees, as well as their applications. By the end of this course, you will be able to understand the principle of Hashing, design and implement Hashtables for real problems, understand and implement typical balanced binary search trees such as Splay tree, Red-Black tree as well as B-tree, use BBST to solve various problems such as range query.阅读更多.

此资源由附属合作伙伴提供。 如果您支付培训费用,我们可能会赚取佣金来支持该网站。

按照数据工作岗位排列职业相关性

Data Structures and Algorithms (III) 中涵盖的技术和工具与 数据科学家 招聘广告中的要求最为相似。

相似度得分(满分 100)