Traversal in Binary Search Tree

Height of a binary tree:

 

Level Order BFS in Binary Search Tree:

output:


DFS in Preorder, Inorder, Postorder:

output: