@@ -10,37 +10,37 @@ def insert(root, node):
1010 root = node
1111 return root
1212
13- if node .value < root .value :
13+ if node .value < root .value :# left
1414 root .left = insert (root .left , node )
1515
16- if node .value > root .value :
16+ if node .value > root .value :# right
1717 root .right = insert (root .right , node )
1818
1919 return root
2020
2121
22- def preOrder (root ):
22+ def preOrder (root ):# root --> left --> right
2323 if root :
2424 print (root .value , end = ' ' )
2525 preOrder (root .left )
2626 preOrder (root .right )
2727
2828
29- def postOrder (root ):
29+ def postOrder (root ):# left --> right --> root
3030 if root :
3131 postOrder (root .left )
3232 postOrder (root .right )
3333 print (root .value , end = ' ' )
3434
3535
36- def InOrder (root ):
36+ def InOrder (root ):# left --> root --> right
3737 if root :
3838 InOrder (root .left )
3939 print (root .value , end = ' ' )
4040 InOrder (root .right )
4141
4242
43- def findMinNode (root ):
43+ def findMinNode (root ):# most left
4444 size = 1
4545 if root :
4646 while root .left :
@@ -49,7 +49,7 @@ def findMinNode(root):
4949 return root .value , size
5050
5151
52- def findMaxNode (root ):
52+ def findMaxNode (root ):# most right
5353 size = 1
5454 if root :
5555 while root .right :
0 commit comments