[LeetCode] 145. Binary Tree Postorder Traversal
Given the root of a binary tree, return the postorder traversal of its nodes’ values. Example 1:Input: root = [1,null,2,3]Output: [3,2,1] Example 2:Input: root = []Output: [] Example 3:Input
[LeetCode] 94. Binary Tree Inorder Traversal
Given the root of a binary tree, return the inorder traversal of its nodes’ values. Example 1:Input: root = [1,null,2,3]Output: [1,3,2] Example 2:Input: root = []Output: [] Example 3:Input:
[LeetCode] 226. Invert Binary Tree
Given the root of a binary tree, invert the tree, and return its root. Example 1:Input: root = [4,2,7,1,3,6,9]Output: [4,7,2,9,6,3,1] Example 2:Input: root = [2,1,3]Output: [2,3,1] Example 3
[LeetCode] 100. Same Tree
Given the roots of two binary trees p and q, write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally identical, and the nodes have the
[LeetCode] 104. Maximum Depth of Binary Tree
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. Example 1:Inpu
[LeetCode] 42. Trapping Rain Water
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. Example 1:Input: height = [0,1,0,2,1,0,1,3,2,1,2,1]
[LeetCode] 144. Binary Tree Preorder Traversal
Given the root of a binary tree, return the preorder traversal of its nodes’ values. Example 1:Input: root = [1,null,2,3]Output: [1,2,3] Example 2:Input: root = []Output: [] Example 3:Input:
[Leetcode] 58. Length of Last Word
Given a string s consisting of words and spaces, return the length of the last word in the string. A word is a maximal substring consisting of non-space characters only. Example 1:Input: s = “Hel