Implementing a Binary Search Tree in C#
This lesson covers the implementation of a very basic binary search tree in C#.
We'll cover the following
Introduction
Node class
To implement a BST, the first thing needed is a node. A node should have a value, a link that points to the left child, another link pointing to the right child, and constructors to set the initial values. This node can be implemented as a class, and here is what it would look like in code:
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.