Content deleted Content added
mNo edit summary |
Tag: Reverted |
||
Line 41:
Given a [[binary tree]], with this node structure:
'''class''' node
node left
node right
Line 48:
One may implement a tree size procedure recursively:
'''function''' tree_size(node)
return 1 + tree_size(node.left) + tree_size(node.right)
}
|