MCPcopy Create free account
hub / github.com/codemistic/Data-Structures-and-Algorithms / newNode

Class newNode

Hashtable/Find-All-Duplicate-Subtrees.py:7–10  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

5# new node with the given data and
6# None left and right pointers.
7class newNode:
8 def __init__(self, data):
9 self.data = data
10 self.left = self.right = None
11
12def inorder(node, m):
13 if (not node):

Callers 1

Calls

no outgoing calls

Tested by

no test coverage detected