0% found this document useful (0 votes)
150 views

Data Structure PDF

This document discusses various tree data structures and algorithms including binary trees, binary search trees, quicksort, mergesort, heaps, and traversal methods like preorder, inorder and postorder. It also mentions stacks, queues, their implementations and operations like creation, deletion, insertion, and searching.

Uploaded by

THULASI
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
150 views

Data Structure PDF

This document discusses various tree data structures and algorithms including binary trees, binary search trees, quicksort, mergesort, heaps, and traversal methods like preorder, inorder and postorder. It also mentions stacks, queues, their implementations and operations like creation, deletion, insertion, and searching.

Uploaded by

THULASI
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Creation

Deletion

Implementation

Search

Insertion

Preorder(DLR)

Traversal

Binary tree Inorder(LDR)


Binary search
Divide and conquer
Postorder(LRD)
Quick sort

Full binary tree


Recursive merge sort

Complete binary tree


Genres
min-max Heap
Advanced tree Perfect binary tree
Data structure
AVL tree
演算法筆記
M-way search tree http://www.csie.ntnu.edu.tw/~u91029/index.html

Recursive and iteration


References
Data structure visualization
http://www.comp.nus.edu.sg/~stevenha/
LIFO

http://www.learn-c.org/
Stack
Array
double-ended queue
Queue
Implementation FIFO queue
Link list
Genres
priority queue

double-ended priority queue


Queue CreateQ(max_size) FIFO

Boolean IsFull(queue, max_size)


ADT
Boolean Isempty(queue)

Queue ADDQ(queue, item)

Element DeleteQ(queue)

You might also like