Search for a command to run...
Articles tagged with #binary-tree
Medium — Binary Tree | Depth-First Search | Recursion | Tree Traversal The Problem Given the root of a binary tree, determine if it is a valid binary search tree where all left descendants are less than the node and all right descendants are greater ...
Medium — Binary Tree | Depth-First Search | Tree Traversal | Recursion The Problem Given the roots of two binary trees, determine if the second tree (subRoot) is a subtree of the first tree (root). A subtree must include all descendants of a node in ...
Easy — Binary Tree | Depth-First Search | Recursion The Problem Given the roots of two binary trees p and q, determine if they are the same tree. Two binary trees are considered the same if they are structurally identical and the nodes have the same ...
Easy — Binary Tree | Depth-First Search | Recursion | Tree The Problem Given the root of a binary tree, return its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. Appro...
Easy — Binary Tree | Recursion | Depth-First Search | Tree Traversal The Problem Given the root of a binary tree, invert the tree by swapping the left and right children of every node, and return the root of the inverted tree. Approach Use a recursiv...
Easy — Binary Tree | Depth-First Search | Tree | Recursion The Problem Find the diameter of a binary tree, which is the length of the longest path between any two nodes in the tree. The path may or may not pass through the root. Approach Use a recurs...
