Can we implement a binary search tree without using recursion in c++ ?!

Question

I have been searching a lot for a non-recursive implementation for a binary search tree

Answer 1

yes you can implement binary search tree without using recursion.

Answer 2

I have implemented ...tomorrow I will search and share my program with you.

Answer 3

Thanks so much :)

Answer 4

@Marc Essam here you can find BST without recursion
https://github.com/Saga305/data_structure

Answer 5

Hey, I am working on delete node method...right now you can refer insert and display method into tree directory of above link..