Given the root of a binary tree and a node in it, return the in-order successor of that node in the BST. If the given node has no in-order successor in the tree, return null. The successor here means that the node will be traversed next in an inorder manner for the given node value.

Find Successor

Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking. Implement Depth First Search for a given input tree.

Depth First Search

Given a Binary Search Tree, Traverse the tree in Preorder, Postorder, and inorder traversal.

BST Traversal

Given a pointer to the root node of a binary tree, return true if the binary tree is height-balanced. A height-balanced binary tree is a Binary tree in which the difference between the left subtree height and the right subtree height is at most 1. Height of a binary tree is the number of edges between the root node to the longest leaf node.

Tree Traversal

Find Successor

Depth First Search

BST Traversal

Height Balanced Binary Tree

Pages

Algochurn

Frontend Churn

Friends

Links