Available question text
Given a binary tree with costs associated with each edge, find the minimum cost to disconnect all leaf nodes by cutting edges.
Related questions
Continue with questions that share topics or the same question type.
- Find the Maximum Ancestor Value Across All Leaf Nodes in a Binary Tree
Coding
- Minimum Cost to Make All Characters Equal
Coding
- Minimum Cost Tree From Leaf Values
Coding
- Minimum Number of Vertices to Reach All Nodes
Coding · Directed Acyclic Graph · Graph Theory
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Google
Minimum Cost to Disconnect All Leaf Nodes
Reported Oct 1, 2024 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source