Computer scienceAlgorithms and Data StructuresData structuresGraphsGraph types

Binary search tree

Theory

The path that connects vertices

Report a typo

Let's consider a binary search tree. Using the "delete" operation, we sequentially remove vertices 8, 4 and 10. Print the path that connects vertices 5 and 11.

Input example: 5 4 6 8 10 11.

The path that connects vertices

Enter a short text
___

Create a free account to access the full topic