You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+2Lines changed: 2 additions & 0 deletions
Original file line number
Diff line number
Diff line change
@@ -93,3 +93,5 @@ Given a binary tree, determine if it is a valid Binary Search Tree (BST).
93
93
[**MaximumDepthOfBinaryTree.java**](https://github.com/techieJarek/coding-problems/blob/master/MaximumDepthOfBinaryTree.java) - Given a binary tree, find its maximum depth.
94
94
95
95
[**MinimumDepthOfBinaryTree.java**](https://github.com/techieJarek/coding-problems/blob/master/MinimumDepthOfBinaryTree.java) - Given a binary tree, find its minimum depth.
96
+
97
+
[**BalancedBinaryTree.java**](https://github.com/techieJarek/coding-problems/blob/master/BalancedBinaryTree.java) - Given a binary tree, determine if it is height-balanced.
0 commit comments