MCPcopy Create free account
hub / github.com/HuberTRoy/leetCode / middlePrint

Method middlePrint

Tree/BinarySearchTree.py:109–114  ·  view source on GitHub ↗
(self)

Source from the content-addressed store, hash-verified

107 self._middlePrint(root.right,result)
108
109 def middlePrint(self):
110 # 左根右
111 result = []
112 self._middlePrint(self.root, result)
113
114 return result
115
116 def _suffPrint(self, root, result):
117 if root.left:

Callers 1

Calls 1

_middlePrintMethod · 0.95

Tested by

no test coverage detected