finding the height of a binary tree
Finding the height of a binary tree refers to determining the length of 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
- balancing binary trees
- binary heap trees
- binary search tree
- binary search trees
- binary tree
- binary tree traversal algorithms
- depth of a binary tree
- height of a binary heap
- height of a binary tree
- in-order traversal of binary trees
- maximum depth of a binary tree
- minimum depth of a binary tree
- perfect binary tree