MMin SiThu·1d agoWhat Is a Binary Tree? How Splitting in Half Finds Anything FastTo put it simply, a binary tree is a way of storing items so that each item points to at most two smaller groups, one holding smaller values on the left and one holding larger values on the right. A p7 min read·itsmeminsithu.hashnode.dev
MMayank Mahajan·Sep 25Level Order Traversal: Intuition, Queue, and BFSUnderstand level order traversal using BFS and queues, with intuition, step-by-step examples, implementation, and complexity.5 min read·mayankdev.hashnode.dev5
Ttracelit·Apr 9LeetCode 1448: Count Good Nodes In Binary Tree — Step-by-Step Visual TraceCount 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 node.1 min read·blog.tracelit.dev
Ttracelit·Apr 9LeetCode 104: Maximum Depth Of Binary Tree — Step-by-Step Visual TraceGiven 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.1 min read·blog.tracelit.dev
Ttracelit·Apr 9LeetCode 226: Invert Binary Tree — Step-by-Step Visual TraceGiven 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.1 min read·blog.tracelit.dev
Ttracelit·Apr 9LeetCode 543: Diameter Of Binary Tree — Step-by-Step Visual TraceFind 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.1 min read·blog.tracelit.dev
Ttracelit·Apr 9LeetCode 105: Construct Binary Tree From Preorder And Inorder Traversal — Step-by-Step Visual TraceGiven two arrays representing preorder and inorder traversals of a binary tree, reconstruct and return the original binary tree.1 min read·blog.tracelit.dev
Ttracelit·Apr 9LeetCode 199: Binary Tree Right Side View — Step-by-Step Visual TraceGiven 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.1 min read·blog.tracelit.dev
Ttracelit·Apr 9LeetCode 124: Binary Tree Maximum Path Sum — Step-by-Step Visual TraceFind 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 end at any nodes in the tree.1 min read·blog.tracelit.dev
Ttracelit·Apr 9LeetCode 102: Binary Tree Level Order Traversal — Step-by-Step Visual TraceGiven 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.1 min read·blog.tracelit.dev