Validate Binary Search Tree Leetcode Solution
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…
Count Complete Tree Nodes Leetcode Solution
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
Binary Tree Right Side View Leetcode Solution
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.
Binary Tree Level Order Traversal Leetcode Solution
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 Solution
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