DEV Community

ann lin
ann lin

Posted on • Edited on

2 2

Tree traversal [Inorder]

Tree is in order. Traverse down the tree to get sorted values using inorder traversal. Inorder traversal is useful to determine if a tree is a binary search tree. Code is in python. Done through recursion.

Top comments (0)

Billboard image

Create up to 10 Postgres Databases on Neon's free plan.

If you're starting a new project, Neon has got your databases covered. No credit cards. No trials. No getting in your way.

Try Neon for Free →

👋 Kindness is contagious

Please leave a ❤️ or a friendly comment on this post if you found it helpful!

Okay