Tree Algorithms
1 + max(height(left), height(right)).
Detailed interactive content for “Tree Height” is planned for a later phase.
1 + max(height(left), height(right)).
The visualization engine is ready to be extended to this topic — the 12 core demonstrations below are fully interactive today.