Home/ Questions/Q 8221181
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-07T13:49:04+00:00

I’m learning Data Structures & Algorithms now. My lecture notes have an implementation of

  • 0

I’m learning Data Structures & Algorithms now.

My lecture notes have an implementation of a binary search tree which is implemented using a recursive method. That is an elegant way, but my question is in real life code, should I implement a binary search tree recursively, will it generate a lot of calling stack if the tree has large height/depth number.

I understand that recursion is a key concept to understand lots of data structure concepts, but would you choose to use recursion in real life code?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    A tree is recursive by nature. Each node of a tree represents a subtree, and each child of each note represents a subtree of that subtree, so recursion is the best bet, especially in practice where other people people might have to edit and maintain your code.

    Now, IF depth becomes a problem for your call stack, than I’m afraid that there are deeper problems with your data structure (either it’s monstrously huge, or it’s very unbalanced)

    • 0