589 views

1 Answer

Best answer
4 votes
4 votes
First of all you need to study about trees in general and make your basic concepts very clear.Then study

1. BST

2 . AVL

3.spanning trees

4. Heap

Along with that if you want specific topics then study balanced trees, n-ary trees, heaps., Tree traversal, operations on tree , minimum spanning trees etc.

Hope it helps
selected by

Related questions

0 votes
0 votes
1 answer
1
once_2019 asked Jun 24, 2018
631 views
Is the root node an internal node?
0 votes
0 votes
0 answers
2
Rohit Gupta 8 asked Oct 27, 2017
1,045 views
Most efficient data structure to implement Sets of Integer and what is the complexity of operationinsert(int e),delete(int e),isMember(int e) : returns TRUE if member oth...
0 votes
0 votes
1 answer
4
resuscitate asked Jan 3, 2016
673 views
describe in details