What is AVL Tree ? AVL stands for ADELSON, VELSKI AND LANDIS. It is a tree representation commonly known as ‘AVL TREE’.Here we have explained an avl tree example in the figure. AVL tree is just like a binary search tree(BST) but it is a balanced tree in data structure. Here the the term balanced […]
DS
Interview Questions from Data Structure Part 1
Data Structure is one of the important subject for students of Computer Science. Some questions are asked every year from Data Structure in GATE/NET exam. This subject covers the topics like Array, Queue, Stack, Link List, Tree, Graph, Sorting and Searching. In this post some important questions from Data Structure are as follows: Q1) […]