Convert Sorted Array to Binary Search Tree With Minimal Height
Given a sorted (increasing order) array, Convert it to create a binary search tree with minimal height.
Recent posts
Invert Binary Tree
Invert a binary tree. Left and right subtrees exchange.
Minimum Depth of Binary Tree
Given a binary tree, find its minimum depth.
N-ary Tree Preorder Traversal
Given an n-ary tree, return the preorder traversal of its nodes’ values.
Leaf-Similar Trees
Consider all the leaves of a binary tree. From left to right order, the values of those leaves form a leaf value sequence.
Sum of Left Leaves
Find the sum of all left leaves in a given binary tree.
Binary Tree Tilt
Given a binary tree, return the tilt of the whole tree.
Subtree of Another Tree
Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s.