How to write an algorithm for a binary search tree?

L

L

lilota2014-06-28 19:02:41

Programming

lilota, 2014-06-28 19:02:41

How to write an algorithm for a binary search tree?

The assignment says, consider a binary search tree: Add a dummy leaf v so that all pointers (left or right) that were NULL in the beginning now point to that leaf. Think about how you can speed up the algorithm so that all requests for NULL are ignored.
Can you help me figure out how to write this algorithm in pseudocode?

Reply

Answer the question

Answer the question

In order to leave comments, you need to log in

1 answer(s)

Y

yttrium, 2014-06-28
@yttrium

I advise you to refuse PhD

Similar questions

B

beduin012017-09-04 11:28:23

What is the best way to organize a service monitoring service? 0Reply

S

ssrdop2017-09-07 11:37:29

How can you move the cursor while typing without using the standard keys? 2Reply

A

Alain Kris2017-09-08 19:58:11

How to do search and replace across multiple files in Brackets? 2Reply

V

Valera Programmer2017-09-10 21:35:18

How to update the database on Android with the release of a new version of the application? 2Reply

I

Ilya Karpov2017-09-13 11:37:45

Java, how to make a learning plan and where to start coding? 4Reply

Didn't find what you were looking for?

Ask your question

Ask a Question

731 491 924 answers to any question