[LeetCode] 506. Relative Ranks
You are given an integer array score of size n, where score[i] is the score of the ith athlete in a competition. All the scores are guaranteed to be unique. The athletes are placed based on their scor
[LeetCode] 513. Find Bottom Left Tree Value
Given the root of a binary tree, return the leftmost value in the last row of the tree. Example 1:Input: root = [2,1,3]Output: 1 Example 2:Input: root = [1,2,3,4,null,5,6,null,null,7]Output:
[LeetCode] 102. 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). Example 1:Input: root = [3,9,20,null,null,15,7]Output: [[3],[9,
[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