st common ancestor(LCA) in binary tree in java?

C++ DATA STRUCTURES: How do I solve this red black tree

When a tree is instantiated from the Java Standard Library to store ordered data, the specific type of tree that is returned can be determined?

In Haskell, how do you update a value of a particular node in a binary tree? Consider each node having a (Key,Value) tuple (where all keys are unique). Given an already existing key and its new value, I want to update the value of the key in the binary tree. Kindly provide Haskell code with an example.

1. Implementation of hostel management system showing Binary search tree (BST) using C++ programming language and 2. Used Splay tree, instead of BST with the same Language (C++).

In Java,  What is the difference between a heap (a minheap) and a binary search tree? What is the difference between a minheap and a maxheap?

Write a program in C++ to implement Binary Search Tree with insert, delete and search operations.

What is the advantages and disadvantages between heap and binary search tree?

Write Java code to:  find the lowest common ancestor of two nodes n1, n2 in a linked binary tree structure. The lowest common ancestor is the lowest node in the tree thathas both n1 and n2 as descendants.

Write out tree traversals for a binary search tree, before and after a putoperation (Please do it in c++ language)