Daily Challenge

November 26, 2025

Binary Tree Inorder Traversal

Data Structures Medium 25 points

Return the inorder traversal of a binary tree.

Success Rate
0%

Problem Statement

Given the root of a binary tree, return the inorder traversal of its nodes' values.

Examples

Input:

root = [1,null,2,3]

Output:

[1,3,2]

Explanation:

Inorder traversal visits left subtree, root, then right subtree.

0 attempts today 3 languages
Login to Start

Previous Daily Challenges

Build a URL Shortener

Nov 25, 2025
Medium

Create a URL shortening service like bit.ly with analytics and custom domains.

100 points View Challenge

Fibonacci Sequence

Nov 22, 2025
Easy

Calculate the nth Fibonacci number.

15 points View Challenge

Chat Application with Real-time Features

Nov 21, 2025
Medium

Build a real-time chat application with user authentication and message history.

80 points View Challenge

Personal Finance Tracker

Nov 19, 2025
Medium

Build a comprehensive personal finance tracking application.

90 points View Challenge

E-commerce Inventory Management System

Nov 18, 2025
Hard

Build a complete inventory management system for an e-commerce platform.

120 points View Challenge

Reverse String

Nov 16, 2025
Beginner

Write a function that reverses a string.

5 points View Challenge