Given a Binary Search Tree and a target number, return true if there exist two elements in the BST such that their sum is equal to the given target. E......

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. F......

Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the dept......

Given a non-empty binary search tree and a target value, find the value in the BST that is closest to the target. Note: Given target value is a floati......

Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical a......

Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). For ......

Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: 1 / \ 2 3 \ 5 All root-to-leaf paths are: ["1->2-......