Don’t worry if it doesn’t work right. If everything did, you’d be out of a job. Mosher’s Law
A binary search tree is a rooted binary tree, whose internal nodes each store a key and each node has two distinguished sub-trees, left and right. The binary search tree property, which states that the key in each node must be greater than all keys stored in the left sub-tree, and smaller than all keys in right sub-tree. The stack is a data structure with last in first out (LIFO) insertion order. The Stack can use for traversing the tree without recursion.
Write a program to print the Binary search Tree nodes using stack operation.
Insert [12,3,6] elements to Stack Traverse the elements from Stack: 3 6 12