Binary Tree - LeetCode
Copyright © 2025 LeetCode Help Center Jobs Bug Bounty Assessment Students Terms Privacy Policy United States
Binary Tree Inorder Traversal - LeetCode
Can you solve this real interview question? Binary Tree Inorder Traversal - Given the root of a binary tree, return the inorder traversal of its nodes' values.
Binary Tree Paths - LeetCode
Can you solve this real interview question? Binary Tree Paths - Given the root of a binary tree, return all root-to-leaf paths in any order. A leaf is a node with no children.
Binary Tree - LeetCode
In the introduction, we have gone through the concept of a tree and a binary tree. In this chapter, we will focus on the traversal methods used in a binary tree.
Binary Tree Level Order Traversal - LeetCode
Binary Tree Level Order Traversal - Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level).
Maximum Depth of Binary Tree - LeetCode
Given the root of a binary tree, return its maximum depth. A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
Invert Binary Tree - LeetCode
Can you solve this real interview question? Invert Binary Tree - Given the root of a binary tree, invert the tree, and return its root.
Construct Binary Tree from Preorder and Inorder Traversal - LeetCode
Construct Binary Tree from Preorder and Inorder Traversal - Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is the inorder traversal of …
All Possible Full Binary Trees - LeetCode
All Possible Full Binary Trees - Given an integer n, return a list of all possible full binary trees with n nodes. Each node of each tree in the answer must have Node.val == 0.
Balanced Binary Tree - LeetCode
Can you solve this real interview question? Balanced Binary Tree - Given a binary tree, determine if it is height-balanced.