nodes of "from left to right indeedfor every node vthe inorder traversal visits after all the nodes in the left subtree of and before all the nodes in the right subtree of (see figure figure inorder traversal of binary tree binary search trees let be set whose elements have an order relation for examples could be set of integers binary search tree for is proper binary tree such that each internal node of stores an element of sdenoted with (vfor each internal node of tthe elements stored in the left subtree of are less than or equal to (vand the elements stored in the right subtree of are greater than or equal to (vthe external nodes of do not store any element an inorder traversal of the internal nodes of binary search tree visits the elements in nondecreasing order (see figure