Calculate the total sum of all root-to-leaf numbers.
Invert a binary tree.
Given a binary tree, return the preorder traversal of its nodes’ values.
Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.
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.
Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.
Given a binary tree, return all root-to-leaf paths.
Given two binary trees, write a function to check if they are equal or not.
Given a binary tree, return the inorder traversal of its nodes' values. (Both recursive and iterative solutions)
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.