Editing Binary search tree (section)

==Traversal==
{{Main article|Tree traversal}}
{{see also|Threaded binary tree}}
A BST can be [[Tree traversal|traversed]] through three basic algorithms: [[inorder traversal|inorder]], [[pre-order traversal|preorder]], and [[post-order traversal|postorder]] tree walks.<ref name="algo_cormen" />{{rp|287}}
*'''Inorder tree walk''': Nodes from the left subtree get visited first, followed by the root node and right subtree. Such a traversal visits all the nodes in the order of non-decreasing key sequence.
*'''Preorder tree walk''': The root node gets visited first, followed by left and right subtrees.
*'''Postorder tree walk''': Nodes from the left subtree get visited first, followed by the right subtree, and finally, the root.

Following is a recursive implementation of the tree walks.<ref name="algo_cormen" />{{rp|287–289}}
{|
|- style="vertical-align:top"
|
  Inorder-Tree-Walk(x)
    '''if''' x &ne; NIL '''then'''
      Inorder-Tree-Walk(x.left)
      ''visit node''
      Inorder-Tree-Walk(x.right)
    '''end if'''
|
  Preorder-Tree-Walk(x)
    '''if''' x &ne; NIL '''then'''
      ''visit node''
      Preorder-Tree-Walk(x.left)
      Preorder-Tree-Walk(x.right)
    '''end if'''
|
  Postorder-Tree-Walk(x)
    '''if''' x &ne; NIL '''then'''
      Postorder-Tree-Walk(x.left)
      Postorder-Tree-Walk(x.right)
      ''visit node''
    '''end if'''
|}