Inorder Traversal of a BST

Visits nodes in ascending order

O(n)

Python | Java

A binary search tree is a binary tree where the left child is smaller and the right child is greater than its parent.
Traverse a BST using Inorder to:

· visit the tree in sorted order
· validate whether a binary tree is a binary search tree

LeetCode

98. Validate Binary Search Tree

Python | Java

• Relevant Problems

  https://leetcode.com/problems/validate-binary-search-tree/

  https://leetcode.com/problems/minimum-absolute-difference-in-bst/

  https://leetcode.com/problems/convert-bst-to-greater-tree/