What is a Tree/binary search tree, How to perform add, delete operation in BST, whats the time complexity, asked to write complete code on paper

Question

Accepted Answer

BST is a binary tree where left child is smaller and right child is greater. Add/delete ops maintain this property.

BST is a data structure used for searching, sorting, and storing data
Add operation: Traverse the tree and find the appropriate position to insert the new node
Delete operation: Find the node to be deleted, replace it with its inorder successor or predecessor, and delete the successor/predecessor node
Time complexity: O(log n) for both add and delete operations
Code example: https://www.geeksforgeeks.org/binary-search-tree-set-1-search-and-insertion/

Popular interview questions of Software Engineer