data structure is used to represent hierarchical relationships, Tree, A Binary Tree where every node has at most two children is called, Binary Tree, In-order Traversal of a BST produces, Sorted values, the traversal order of Post-order, Left → Right → Root, traversal is widely used in expression tree evaluation, Post-order Traversal, A BST allows duplicates. Where are duplicates usually placed, Right subtree, Which of the following is a self-balancing BST, AVL Tree, The balance factor in AVL tree is computed as, Height(left) − Height(right), A Min-Heap ensures that, Parent node is smaller than or equal to its children, Which data structure is used to implement heaps, Array, A graph with no direction on its edges is called, Undirected Graph, A graph that has edges with costs or distances is called, Weighted Graph, BFS uses which data structure, Queue, DFS uses which data structure, Stack, DFS is preferred when, Exploring deep paths first, Dijkstra’s algorithm finds, Shortest path from a single source, graph algorithm requires priority queue, Dijkstra’s Algorithm, Which algorithm is greedy, Prim’s Algorithm, Prim’s algorithm belongs to which category, Minimum Spanning Tree (MST) Algorithm, Which algorithm uses Union-Find data structure, Kruskal’s Algorithm, MST algorithm builds tree edge by edge, Kruskal’s Algorithm, Example of single-source shortest path algorithm, Dijkstra’s Algorithm, data structure tracks visited nodes in DFS, Stack, Time complexity of BFS in adjacency list, O(V + E), Technique used to detect graph cycles, Union-Find, A tree where left subtree contains smaller values, Binary Search Tree (BST), A self-balancing tree using rotations, AVL Tree, Left-Right rotation is called, LR Rotation, A tree where each node is greater than its children, Max-Heap, Traversal that visits nodes level by level, Level-Order Traversal, A graph that has no cycles, Acyclic Graph, Graph algorithm that explores neighbors first, Breadth-First Search (BFS), Structure used in Kruskal's to detect cycles, Union-Find, Algorithm that finds shortest path using priority queue, Dijkstra’s Algorithm, Data structure used internally in heaps, Array, two (2) types of Binary Tree Traversal categories, Depth-First Traversal, Breadth-First Traversal, four (4) types of Tree Traversals, In-order, Pre-order, Post-order, Level-order, three (3) types of Graphs, Directed Graph, Undirected Graph, Weighted Graph, two (2) graph traversal algorithms, BFS (Breadth-First Search), DFS (Depth-First Search), two (2) applications of BFS or DFS, Graph traversal, Path finding, two (2) algorithms used to find Minimum Spanning Tree (MST), Prim’s Algorithm, Kruskal’s Algorithm.

DATA STRUCTURE

prie
Spausdinti
Įterpti

Lyderių lentelė

Vizualinis stilius

Parinktys

Pakeisti šabloną

)
Atkurti automatiškai įrašytą: ?