Tag: architecture

Values in a node is greater than every value in left sub tree and smaller than right sub tree

Values in a node is greater than every value in children of it

Both of above conditions applies

None of above conditions applies

endpoints of e

adjacent nodes

neighbors

all of above

a tree graph

free tree

a tree

All of above

u is adjacent to v but v is not adjacent to u

e begins at u and ends at v

u is processor and v is successor

both b and c

isolated

complete

finite

strongly connected

Stacks

Queues

Deques

Binary search tree

Input-restricted deque

Output-restricted deque

Priority queues

None of above

Deque

Priority

Tree

All of above

Complete binary tree

Binary search tree

Extended binary tree

None of above

P contains the address of an element in DATA.

P points to the address of first element in DATA

P can store only memory addresses

P contain the DATA and the address of DATA