maximum depth of a binary tree
The maximum depth of a binary tree refers to the longest path from the root node to a leaf node in a binary tree.
Requires login.
Related Concepts (1)
Similar Concepts
- balanced binary tree
- balanced binary trees
- binary search tree
- binary search trees
- binary tree
- binary trees
- complete binary tree
- finding the height of a binary tree
- full binary trees
- height of a binary heap
- height of a binary tree
- minimum depth of a binary tree
- perfect binary tree
- post-order traversal of binary trees
- recursion depth