![653. Two Sum IV – Input is a BST](https://jingine.com/wp-content/themes/boke-x/thumb.php?src=https://jingine.com/wp-content/themes/boke-x/images/4.jpg&w=400&h=260)
653. Two Sum IV – Input is a BST
Given a Binary Search Tree and a target number, return true if there exist two elements in the BST s…
![112. Path Sum](https://jingine.com/wp-content/themes/boke-x/thumb.php?src=https://jingine.com/wp-content/themes/boke-x/images/9.jpg&w=400&h=260)
112. Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all…
![110. Balanced Binary Tree](https://jingine.com/wp-content/themes/boke-x/thumb.php?src=https://jingine.com/wp-content/themes/boke-x/images/6.jpg&w=400&h=260)
110. Balanced Binary Tree
Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary …
![270. Closest Binary Search Tree Value](https://jingine.com/wp-content/themes/boke-x/thumb.php?src=https://jingine.com/wp-content/themes/boke-x/images/2.jpg&w=400&h=260)
270. Closest Binary Search Tree Value
Given a non-empty binary search tree and a target value, find the value in the BST that is closest t…
![100. Same Tree](https://jingine.com/wp-content/themes/boke-x/thumb.php?src=https://jingine.com/wp-content/themes/boke-x/images/6.jpg&w=400&h=260)
100. Same Tree
Given two binary trees, write a function to check if they are equal or not. Two binary trees are con…
![107. Binary Tree Level Order Traversal II](https://jingine.com/wp-content/themes/boke-x/thumb.php?src=https://jingine.com/wp-content/themes/boke-x/images/8.jpg&w=400&h=260)
107. Binary Tree Level Order Traversal II
Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, fro…
![257. Binary Tree Paths](https://jingine.com/wp-content/themes/boke-x/thumb.php?src=https://jingine.com/wp-content/themes/boke-x/images/7.jpg&w=400&h=260)
257. Binary Tree Paths
Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: 1 …