Trees Courses and Certifications

Understanding and Using Trees in Python

Implement binary trees, binary search trees, and heaps in Python, traverse them with DFS and BFS, and solve interview problems like finding the kth largest element.

• CodeSignal
• 3 hours
• Self-Paced
• Free Certificate

Learn Advanced Data Structures with Python: Trees

25 ratings at Codecademy

Explore tries and binary indexed trees in Python to build efficient search and accumulation operations.

• Codecademy
• 1 hour
• Self-Paced
• Free Trial Available

Kunal Kushwaha

Segment Trees Tutorial - Range Queries - Interview Questions

Learn how segment trees handle range queries and updates, then follow an implementation from scratch.

• YouTube
• 1 hour 13 minutes
• Self-Paced
• Free Video

Great Learning

Trees in Java - Introduction to Trees in Java - Java Programming

Explore tree and binary search tree concepts, traversals, operations, and Java implementation for hierarchical data structures.

• YouTube
• 1 hour 5 minutes
• Self-Paced
• Free Video

javidx9

Quad Trees for Static Spatial Acceleration - Part 1

Learn to implement static quad trees for spatial partitioning and faster object searches.

• YouTube
• 44 minutes
• Self-Paced
• Free Video

Simple Snippets

M-way Trees and M-way Search Trees - Comparison with Binary Search Trees

An introduction to multiway trees focused on how their structure and search behavior differ from binary trees and binary search trees.

• YouTube
• 24 minutes
• Self-Paced
• Free Video

Great Learning

Trees in Python

Learn to implement binary trees and binary search trees in Python, including preorder, postorder, and inorder traversal.

• YouTube
• 33 minutes
• Self-Paced
• Free Video

Data Structures & Algorithms II: Binary Trees, Heaps, SkipLists and HashMaps

7 ratings

Become familiar with nonlinear and hierarchical data structures. Study various tree structures: Binary Trees, BSTs and Heaps. Understand tree operations and algorithms. Learn and implement HashMaps th

• edX
• 5 weeks, 9-10 hours a week
• Self-Paced
• Free Online Course (Audit)

Data Structures & Algorithms III: AVL and 2-4 Trees, Divide and Conquer Algorithms

7 ratings

Learn more complex tree data structures, AVL and (2-4) trees. Investigate the balancing techniques found in both tree types. Implement these techniques in AVL operations. Explore sorting algorithms wi

• edX
• 5 weeks, 9-10 hours a week
• Self-Paced
• Free Online Course (Audit)

Trees and Graphs: Basics

192 ratings at Coursera

Basic algorithms on tree data structures, binary search trees, self-balancing trees, graph data structures and basic traversal algorithms on graphs. This course also covers advanced topics such as kd-trees for spatial data and algorithms for spatial data.

• Coursera
• 4 weeks, 9 hours a week
• Self-Paced
• Paid Course

Codio

C++: Linear Data Structures and Trees

Implement linear data structures in C++ — singly, doubly and circular linked lists, stacks, queues, deques — then move to binary search, AVL, red-black and B-trees.

• Coursera
• 4 weeks, 4 hours a week
• Self-Paced
• Paid Course

Codio

Java: Linear Data Structures and Trees

Implement linear and non-linear data structures in Java: singly, doubly and circular linked lists, stacks, queues, deques, binary search trees, AVL, Red-Black and B-trees.

• Coursera
• 4 weeks, 4 hours a week
• Self-Paced
• Paid Course

Packt

Intermediate Algorithms: Graphs, Trees, and Backtracking

Solve tree and graph problems with DFS, BFS, and union-find, apply backtracking to Combination Sum and Word Search, and implement tries and heap-based priority queues.

• Coursera
• 5 weeks, 3 hours a week
• Self-Paced
• Paid Course

Coursera

Manage Binary Trees for Java Performance

Implement and optimize Binary Search Trees in Java: insertion, deletion, traversal, time complexity of skewed versus balanced trees, rotations, and AVL self-balancing.

• Coursera
• 3 weeks, 2 hours a week
• Self-Paced
• Paid Course

Coursera

Traverse Trees for ML with DFS & BFS

Implement decision trees in Java and traverse them with breadth-first and depth-first search to generate tree rulesets, comparing results with ID3 and CART.

• Coursera
• 3 weeks, 1 hour a week
• Self-Paced
• Paid Course