Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as follows: The left subtree of a node…

Given the root of a complete binary tree, return the number of the nodes in the tree.According to Wikipedia, every level,except possibly the last, is completely

Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.

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).

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

Question 9. Palindrome Number – Leetcode Javascript Solution Difficulty Easy Question Type String Question Link https://leetcode.com/problems/palindrome-number/ Problem Description : Given an integer x, return true if x is palindrome integer. An…

Question 34. Find First and Last Position of Element in Sorted Array – Leetcode Javascript Solution Difficulty Medium Question Type Array Question Link https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/ Problem Description : Given an array of…

Question 215. Kth Largest Element in an Array – Leetcode Javascript Solution Difficulty Medium Question Type Array Question Link https://leetcode.com/problems/kth-largest-element-in-an-array/ Problem Description : Given an integer array nums and an…