height of a binary tree
The height of a binary tree refers to the maximum number of edges in the longest path from the root node to any leaf node in the tree.
Requires login.
Related Concepts (1)
Similar Concepts
- balanced binary tree
- balanced binary trees
- binary heap 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
- maximum depth of a binary tree
- minimum depth of a binary tree
- perfect binary tree
- perfect binary trees