class_docstr: :class:`~matplotlib.tri.TriFinder` class implemented using the trapezoid
  map algorithm from the book "Computational Geometry, Algorithms and
  Applications", second edition, by M. de Berg, M. van Kreveld, M. Overmars
  and O. Schwarzkopf.
  
  The triangulation must be valid, i.e. it must not have duplicate points,
  triangles formed from colinear points, or overlapping triangles.  The
  algorithm has some tolerance to triangles formed from colinear points, but
  this should not be relied upon.
docstr: Return a python list containing the statistics about the node tree:
      0: number of nodes (tree size)
      1: number of unique nodes
      2: number of trapezoids (tree leaf nodes)
      3: number of unique trapezoids
      4: maximum parent count (max number of times a node is repeated in
             tree)
      5: maximum depth of tree (one more than the maximum number of
             comparisons needed to search through the tree)
      6: mean of all trapezoid depths (one more than the average number
             of comparisons needed to search through the tree)
docstr_tok: ["Return","a","python","list","containing","the","statistics","about","the","node","tree",":","0",":","number","of","nodes","(","tree","size",")","1",":","number","of","unique","nodes","2",":","number","of","trapezoids","(","tree","leaf","nodes",")","3",":","number","of","unique","trapezoids","4",":","maximum","parent","count","(","max","number","of","times","a","node","is","repeated","in","tree",")","5",":","maximum","depth","of","tree","(","one","more","than","the","maximum","number","of","comparisons","needed","to","search","through","the","tree",")","6",":","mean","of","all","trapezoid","depths","(","one","more","than","the","average","number","of","comparisons","needed","to","search","through","the","tree",")"]
code: def _get_tree_stats(self):
      """
      Return a python list containing the statistics about the node tree:
          0: number of nodes (tree size)
          1: number of unique nodes
          2: number of trapezoids (tree leaf nodes)
          3: number of unique trapezoids
          4: maximum parent count (max number of times a node is repeated in
                 tree)
          5: maximum depth of tree (one more than the maximum number of
                 comparisons needed to search through the tree)
          6: mean of all trapezoid depths (one more than the average number
                 of comparisons needed to search through the tree)
      """
      return self._cpp_trifinder.get_tree_stats()
  
file_path: catboost/contrib/python/matplotlib/py2/matplotlib/tri/trifinder.py
imports: from __future__ import absolute_import, division, print_function, unicode_literals
  import six
  from matplotlib.tri import Triangulation
  import matplotlib._tri
  import numpy
label_desc: Use image node_id 3 for calling the TrapezoidMapTriFinder obj's underlying member method code with example usage: obj._get_tree_stats() and returns: self