Manage Binary Trees for Java Performance

本课程是 Level Up: Java-Powered Machine Learning 专项课程的一部分

位教师：Sonali Sen Baidya

访问权限由 New York State Department of Labor 提供

3个模块

深入了解一个主题并学习基础知识。

高级设置等级

推荐体验

5 小时完成

灵活的计划

自行安排学习进度

3个模块

深入了解一个主题并学习基础知识。

高级设置等级

推荐体验

5 小时完成

灵活的计划

自行安排学习进度

您将学到什么

Apply node-insertion and deletion operations in Java to maintain a Binary Search Tree.
Evaluate the time complexity of search, insertion, and deletion operations for both balanced and skewed BSTs.
Demonstrate balancing techniques (e.g., AVL rotations) to improve BST performance.

您将获得的技能

您将学习的工具

Tree Maps

要了解的详细信息

可分享的证书

添加到您的领英档案

作业

1 项作业

授课语言：英语（English）

了解顶级公司的员工如何掌握热门技能

了解关于 Coursera for Business 的更多信息

Petrobras, TATA, Danone, Capgemini, P&G 和 L'Oreal 的徽标

积累特定领域的专业知识

本课程是 Level Up: Java-Powered Machine Learning 专项课程专项课程的一部分

在注册此课程时，您还会同时注册此专项课程。

向行业专家学习新概念
获得对主题或工具的基础理解
通过实践项目培养工作相关技能
获得可共享的职业证书

该课程共有3个模块

Transform your Java development skills by mastering the secret to building high-performance, scalable applications: Binary Search Trees. This course includes comprehensive career development resources to help learners transition into software engineering and performance optimization roles. You’ll receive guidance on exploring career paths in backend engineering, systems performance engineering, and Java development. Learners will also discover how to build job-ready portfolios showcasing data structure and algorithm projects, optimize resumes with performance-tuning and Java-specific keywords, and prepare for technical interviews focused on Binary Search Trees, complexity analysis, and balancing techniques. By the end of this course, you’ll have the skills to confidently implement and optimize Binary Search Trees in Java, diagnose and prevent performance bottlenecks caused by skewed trees, and apply balancing techniques to enhance runtime efficiency and search performance.

This module introduces the fundamentals of Binary Search Trees (BSTs) and demonstrates how the structure of a tree—whether balanced or skewed—directly affects search performance in Java applications. Learners will explore BST properties, node insertion and deletion rules, and tree traversal techniques, gaining hands-on experience to understand how different insertion patterns impact tree shape and efficiency.

涵盖的内容

4个视频2篇阅读材料1次同伴评审

4个视频总计39分钟

Welcome to Binary Tree Performance 4分钟
Fundamentals of Binary Search Trees 9分钟
Implementing Node Insertion in Java 17分钟
Deletion in Binary Search Trees 9分钟

2篇阅读材料总计15分钟

Welcome to the Course: Course Overview 5分钟
Binary Search Trees Explained 10分钟

1次同伴评审总计25分钟

Hands-On-Learning: Exploring BST and its Operations Using Java 25分钟

This module introduces learners to the performance characteristics of Binary Search Trees in Java. It emphasizes the role of tree height in determining runtime efficiency and contrasting balanced and skewed structures. Learners will explore the time complexity of search, insertion, and deletion operations, analyze performance through code benchmarks, and use visualization tools to understand how insertion patterns impact efficiency.

涵盖的内容

3个视频1篇阅读材料1次同伴评审

This module introduces learners to balancing techniques that maintain BST performance over time. It covers why skew occurs, how rotations restore balance, and how self-balancing trees (e.g., AVL) guarantee O(log n) operations. Learners will explore rotation algorithms, practice rebalancing skewed trees, and apply optimization strategies to ensure consistent runtime efficiency in Java applications.

涵盖的内容

4个视频1篇阅读材料1个作业2次同伴评审

4个视频总计36分钟

Introduction to AVL Trees 9分钟
Implementing Rotations in Java 14分钟
Case Study: From Skewed to Balanced BST 10分钟
Course Wrap-Up 4分钟

1篇阅读材料总计10分钟

AVL Rotations Explained 10分钟

1个作业总计20分钟

Manage Binary Trees for Java Performance 20分钟

2次同伴评审总计90分钟

Hands-On-Learning: Implementing AVL Tree Rotations for Guaranteed Performance 30分钟
Project: The Complete Binary Search Tree Performance Challenge: From Degradation to Optimization 60分钟