Binary Search Tree (BST) methods pseudocode

cheems.js

// INORDER TRAVERAL OF A TREE
// TRAVERSE THE TREE IN ORDER
IF tree NOT NULL
   Inorder(tree->left)
   Visit(tree->data)
   Inorder(tree->right)
   
// Inorder(node *node)
// SORT THE NODES IN ASCENDING ORDER
VOID Inorder(node *node)
   // BASE CASE
   IF node EQUALS NULL
      RETURN
   Inorder(node->left)
   OUTPUT node->data
   Inorder(node->right)

// SEARCH FOR A NODE WITHIN THE TREE
VOID SearchTree(node *node, int key)
   // BASE CASE
   IF node EQUALS NULL
      OUTPUT "NOT FOUND"
      RETURN
   IF key EQUALS node->data
      OUTPUT "FOUND"
      RETURN
   IF key LESS THAN node->data
      SearchTree(node->left, key)
   ELSE
      SearchTree(node->right, key)
      
// FIND A NODE WITH THE MAXIMUM VALUE
VOID MaxValue(node *node)
   // BASE CASE
   IF node->right EQUALS NULL
      OUTPUT node->data
      RETURN
   MaxValue(node->right)