Question: Practice questions related to Binary Trees and Binary Search Trees language:C Questions on Binary Search Trees (BST): 1.Create a BST by inserting the elements 6,
Practice questions related to Binary Trees and Binary Search Trees
language:C
Questions on Binary Search Trees (BST):
1.Create a BST by inserting the elements 6, 1, 4, 7, 5, 8, 2, 3, 9. Then, remove 8 and 4 from the obtained tree.
2.Write an algorithm gets a BST and returns the maximal element.
3.How many distinct BSTs can be created with values 1,2,3,,n?
4.Write an algorithm that gets a PostOrder traversal of a BST, and returns the tree. Prove that such BST is unique.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
