LeetCode 543. Diameter of Binary Tree
Description https://leetcode.com/problems/diameter-of-binary-tree/ Given a binary tree, you need to compute the length of the diameter of the tree. The diameter…
Category: Binary Tree
LeetCode 108. Convert Sorted Array to Binary Search Tree
Description https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/ Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For…
LeetCode 98. Validate Binary Search Tree
Description https://leetcode.com/problems/validate-binary-search-tree/ Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is…
LeetCode 102. Binary Tree Level Order Traversal
Description https://leetcode.com/problems/binary-tree-level-order-traversal/ Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by…
LeetCode 111. Minimum Depth of Binary Tree
Description https://leetcode.com/problems/minimum-depth-of-binary-tree/description/ Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the…
LeetCode 110. Balanced Binary Tree
Description https://leetcode.com/problems/balanced-binary-tree/description/ Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined…
LeetCode 104. Maximum Depth of Binary Tree
Description Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest…
LeetCode 101. Symmetric Tree
Description https://leetcode.com/problems/symmetric-tree/description/ Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For…
LeetCode 100. Same Tree
Description https://leetcode.com/problems/same-tree/description/ Given two binary trees, write a function to check if they are the same or not. Two binary…
LeetCode 144. Binary Tree Preorder Traversal
Description https://leetcode.com/problems/binary-tree-preorder-traversal/description/ Given a binary tree, return the preorder traversal of its nodes’ values. For example: Given binary tree {1,#,2,3}, 1 \ 2…