Scribd
Upload
12 views

Coding

The document discusses various operations that can be performed on binary search trees including finding and deleting nodes, finding minimum and maximum values, finding inorder successors and predecessors, finding the lowest common ancestor of two nodes, merging two BSTs, and finding the Kth largest and smallest elements.

Uploaded by

Adithya Narayan
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
12 views

Coding

The document discusses various operations that can be performed on binary search trees including finding and deleting nodes, finding minimum and maximum values, finding inorder successors and predecessors, finding the lowest common ancestor of two nodes, merging two BSTs, and finding the Kth largest and smallest elements.

Uploaded by

Adithya Narayan
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Binary Search Trees

Find a value in a BST


Deletion of a node in a BST
Find min and max value in a BST
Find inorder successor and inorder predecessor in a BST
Find LCA of 2 nodes in a BST
Merge two BST [ V.V.V>IMP ]
Find Kth largest element in a BST
Find Kth smallest element in a BST
Replace every element with the least greater element on its right
Largest BST in a Binary Tree [ V.V.V.V.V IMP ]

You might also like