minimum depth of a binary tree
The minimum depth of a binary tree is the shortest distance from the root node to a leaf node.
Requires login.
Related Concepts (1)
Similar Concepts
- balanced binary tree
- balanced binary trees
- binary search tree
- binary search trees
- binary tree
- binary tree representation
- binary trees
- finding the height of a binary tree
- full binary trees
- height of a binary heap
- height of a binary tree
- maximum depth of a binary tree
- optimal binary search trees
- perfect binary tree
- perfect binary trees