Minimum and Maximum Leaf Depth in a Tree: Difference between revisions

From NovaOrdis Knowledge Base
Jump to navigation Jump to search
Line 2: Line 2:
* [[Trees#Tree_Algorithms|Trees]]
* [[Trees#Tree_Algorithms|Trees]]
=Overview=
=Overview=
Context: [[Tree_Representation_in_Memory|Tree Representation in Memory]]
Minimum leaf depth:
Minimum leaf depth:
<syntaxhighlight lang='java'>
<syntaxhighlight lang='java'>

Revision as of 23:28, 10 November 2021

Internal

Overview

Context: Tree Representation in Memory

Minimum leaf depth:

public static int minLeafDepth(N n, int depth) {
  if (n == null) {
     return Integer.MAX_VALUE;
  }
  if (n.l == null && n.r == null) {
     // I am a leaf
     return depth;
  }
  return Math.min(minLeafDepth(n.l, depth + 1), minLeafDepth(n.r, depth + 1));
}