Trees Pseudocode

1procedure INORDER(node)
2  if node = NULL then return
3  INORDER(node.left)
4  visit node.value
5  INORDER(node.right)
6end procedure

1procedure PREORDER(node)
2  if node = NULL then return
3  visit node.value
4  PREORDER(node.left)
5  PREORDER(node.right)
6end procedure

1procedure POSTORDER(node)
2  if node = NULL then return
3  POSTORDER(node.left)
4  POSTORDER(node.right)
5  visit node.value
6end procedure

1procedure BST_INSERT(root, key)
2  if root = NULL then
3    return new Node(key)
4  end if
5  if key < root.value then
6    root.left ← BST_INSERT(root.left, key)
7  else if key > root.value then
8    root.right ← BST_INSERT(root.right, key)
9  end if
10  return root
11end procedure