Apr 9 · 1 min read · 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...
Join discussionApr 9 · 1 min read · 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...
Join discussionApr 9 · 1 min read · 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...
Join discussionApr 9 · 1 min read · Medium — Binary Tree | Depth-First Search | Recursion | Tree Traversal The Problem Count the number of 'good' nodes in a binary tree, where a node is considered good if there are no nodes with a value greater than it in the path from root to that nod...
Join discussionApr 9 · 1 min read · Medium — Binary Tree | Recursion | Array | Tree Construction The Problem Given two arrays representing preorder and inorder traversals of a binary tree, reconstruct and return the original binary tree. Approach Use the preorder array to identify root...
Join discussionApr 9 · 1 min read · Medium — Binary Tree | BFS | Queue | Tree Traversal The Problem Given the root of a binary tree, return the values of the nodes you can see ordered from top to bottom when looking at the tree from the right side. Approach Use level-order traversal (B...
Join discussionApr 9 · 1 min read · Hard — Binary Tree | Depth-First Search | Recursion | Dynamic Programming The Problem Find the maximum sum of any path in a binary tree, where a path is defined as any sequence of nodes connected by parent-child relationships. The path can start and ...
Join discussionApr 9 · 1 min read · Medium — Binary Tree | BFS | Queue | Level Order The Problem Given the root of a binary tree, return the level order traversal of its nodes' values as a list of lists, where each inner list contains all node values at that level from left to right. A...
Join discussionApr 9 · 1 min read · Easy — Binary Tree | Recursion | Tree Traversal | Depth-First Search The Problem Determine if a binary tree is height-balanced, where for every node the heights of its left and right subtrees differ by at most one. Approach Use a recursive helper fun...
Join discussionMar 9 · 12 min read · TLDR: A Binary Tree has at most 2 children per node, but the shape of the tree determines performance. A Full tree has 0 or 2 children. A Complete tree fills left-to-right. A Perfect tree is a symmetric triangle. A Degenerate tree becomes a linked li...
Join discussion
