Range Sum of BST
Given the root of a binary search tree (BST), and integers low and high, find the sum of all node values in the BST that are within the range .
Binary Tree
2.7) Diameter of Binary Tree
Given a binary tree, find the length of the longest path between any two nodes in the tree. This path may or may not pass through the root.
3.1) Maximum Depth of Binary Tree
Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
2.8) Two Trees are Same or not
Given two binary trees, determine if they are structurally identical and have the same node values at corresponding positions.
1.1) What is Tree data structure?
A tree data structure is a hierarchical, non-linear data structure that organizes elements in a tree-like manner. It consists of nodes connected by edges, where each node contains data and…