Data Structures and Algorithms

Front

What are the main operations of a Queue?

Back

INSERT, DELETE.

Front

What are the applications of a Queue?

Back

Used in various scenarios such as scheduling, buffering, and managing resources.

Front

Define a Tree in data structures.

Back

A Tree is a hierarchical data structure consisting of nodes, with a single node as the root and sub-nodes as children.

Front

What are the types of Trees?

Back

Binary Trees, AVL Trees, etc.

Front

What are the properties of Binary Trees?

Back

Each node has at most two children, and they can be traversed in various ways.

Front

List the operations performed on Binary Trees.

Back

Insertion, deletion, searching, and traversal.

Front

What are the types of Binary Tree traversals?

Back

Preorder, postorder, and in-order traversal.

Front

What is a Binary Search Tree?

Back

A Binary Tree where the left child contains only nodes with values less than the parent node, and the right child only nodes with values greater.

Front

What is an AVL Tree?

Back

A self-balancing Binary Search Tree where the difference in heights between left and right subtrees is at most one.

Front

Define a Graph in data structures.

Back

A Graph is a collection of nodes (vertices) and edges connecting pairs of nodes.