Prepare for your exams
Get points
Guidelines and tips
Sell on Docsity
Docsity AI

Prepare for your exams

Study with the several resources on Docsity

Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips

Sell on Docsity

Docsity AI

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents

20 Points

For each uploaded document

Answer questions

5 Points

For each given answer (max 1 per day)

All the ways to get free points

Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

Tree Data Structure, Binary Tree - Data Stuctures - Lecture Slides, Slides of Data Structures and Algorithms

Dr. Bhim Rao Ambedkar University Data Structures and Algorithms

Tree Data Structures, Binary Tree, Code for Simulation, Priority Queue, Recursive definition, Not a Tree, Binary Tree Terminology, Level of a Binary Tree Node, Complete Binary Tree are some of data structures topics and terms you will learn in these lecture slides.

Typology: Slides

2011/2012

Uploaded on 11/03/2012

ekna 🇮🇳

4.2

(5)

75 documents

1 / 26

This page cannot be seen from the preview

Don't miss anything!

Code for Simulation

// print the final avaerage wait time.

double avgWait = (totalTime*1.0)/count;

cout << "Total time: " << totalTime << endl;

cout << “Customer: " << count << endl;

cout << "Average wait: " << avgWait << endl;

Docsity.com

Discover Slides of Data Structures and Algorithms Dr. Bhim Rao Ambedkar University

Partial preview of the text

Download Tree Data Structure, Binary Tree - Data Stuctures - Lecture Slides and more Slides Data Structures and Algorithms in PDF only on Docsity!

Code for Simulation

// print the final avaerage wait time. double avgWait = (totalTime1.0)/count; cout << "Total time: " << totalTime << endl; cout << “Customer: " << count << endl; cout << "Average wait: " << avgWait << endl;*

Priority Queue

#include "Event.cpp" #define PQMAX 30 class PriorityQueue { public: PriorityQueue() { size = 0; rear = -1; }; ~PriorityQueue() {}; int full(void) { return ( size == PQMAX )? 1 : 0; };

Priority Queue

int insert(Event e) { if( !full() ) { rear = rear+1; nodes[rear] = e; size = size + 1; sortElements(); // in ascending order return 1; } cout << "insert queue is full." << endl; return 0; }; int length() { return size; }; };*

Tree Data Structures

• There are a number of applications where

linear data structures are not appropriate.

• Consider a genealogy tree of a family.

Mohammad Aslam Khan Sohail Aslam Javed Aslam Yasmeen Aslam Haaris Saad Qasim Asim Fahd Ahmad Sara Omer

Binary Tree

• A binary tree is a finite set of elements that is

either empty or is partitioned into three disjoint

subsets.

• The first subset contains a single element called

the root of the tree.

• The other two subsets are themselves binary

trees called the left and right subtrees.

• Each element of a binary tree is called a node of

the tree.

Binary Tree

• Binary tree with 9 nodes.

A

B

D

H

C

E

F

G

I

Binary Tree

• Recursive definition

A

B

D

H

C

E

F

G

Left subtree I root Right subtree

Binary Tree

• Recursive definition

A

B

D

H

C

E

F

G

I

Left subtree root

Binary Tree

• Recursive definition

A

B

D

H

C

E

F

G

I

root Right subtree

Binary Tree

• Recursive definition

A

B

D

H

C

E

F

G

I

root Right subtree Left subtree

Tree Data Structure, Binary Tree - Data Stuctures - Lecture Slides, Slides of Data Structures and Algorithms

Related documents

Partial preview of the text

Download Tree Data Structure, Binary Tree - Data Stuctures - Lecture Slides and more Slides Data Structures and Algorithms in PDF only on Docsity!

Code for Simulation

Priority Queue

Priority Queue

Tree Data Structures

• There are a number of applications where

linear data structures are not appropriate.

• Consider a genealogy tree of a family.

Binary Tree

• A binary tree is a finite set of elements that is

either empty or is partitioned into three disjoint

subsets.

• The first subset contains a single element called

the root of the tree.

• The other two subsets are themselves binary

trees called the left and right subtrees.

• Each element of a binary tree is called a node of

the tree.

Binary Tree

• Binary tree with 9 nodes.

A

B

D

H

C

E

F

G

I

Binary Tree

• Recursive definition

A

B

D

H

C

E

F

G

Binary Tree

• Recursive definition

A

B

D

H

C

E

F

G

I

Binary Tree

• Recursive definition

A

B

D

H

C

E

F

G

I

Binary Tree

• Recursive definition

A

B

D

H

C

E

F

G

I

Not a Tree

• Structures that are not trees.

A

B

D