Question

Define height of a binary tree in data structure

Answer 1

Answer:

The height of a binary tree is the largest number of edges in a path from the root node to a leaf node. Essentially, it is the height of the root node. Note that if a tree has only one node, then that node is at the same time the root node and the only leaf node, so the height of the tree

PLEASE MARK BRAINLISTS