Upload File

trees csc 172 spring 2002 lecture 14. lists we have seen lists: public class node { object data;...

  • Home
  • Documents
  • Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }
28
Trees CSC 172 SPRING 2002 LECTURE 14

Upload: shannon-bradley

Post on 31-Dec-2015

219 views

Category:

Documents


0 download

Report

TRANSCRIPT

Page 1: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

Trees

CSC 172

SPRING 2002

LECTURE 14

Page 2: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

ListsWe have seen lists:public class Node {

Object data;Node next;

}

Page 3: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

TreesNow, look at trees:

public class Node {

Object data;

Node left;

Node right;

}

Page 4: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

Rooted Trees

Collection of nodes, one of which is the root

Nodes != root have a unique parent node

Each non-root can reach the root by following parent links one or more times

Page 5: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

Definitions

If node p is the parent of node c

then c is a child of p

Leaf : no children

Interior node : has children

Path : list of nodes (m1,m2,…,mk) such that each is the parent of the following

path “from m1 to mk”

Path length = k-1, number of links, not nodes

Page 6: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

Example: UNIX File Systems

/

/bin /dev /usr…

/dev/term /dev/sound /dev/tty01.

/usr/anna /usr/jon /usr/ted

Page 7: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

If there is a path from m to n, then m is an ancestor of n and n is a descendant of m

Note m == n is possible

Proper ancestors, descendants : m != n

Height of a node n is the length of the longest path from n to a leaf

Height of a tree is the height of its root

Depth of a node is the length of the path from the root to n

Subtree rooted at n is all the descendants of n

Page 8: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

The children of any given note are often ordered “from the left”

Child c1 is to the left of c2 then all the nodes in the subtree rooted at c1 are “to the left” of those in the subtree rooted at c2

Nodes may have labels, which are values associated with the nodes

Page 9: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

Example: Expression Trees

Labels are operands or operators

Leaves : operands

Interior nodes : operators

Children are roots of sub-expressions to which the operator is applied

Page 10: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

(x+1)*(x-y+4)

x 1

x y

*

+ -

- 4

Page 11: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

General TreesSome trees are binary:

public class Node {

Object data;

Node left;

Node right;

}

Page 12: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

Some trees are not binary

/

/bin /dev /usr…

/dev/term /dev/sound /dev/tty01.

/usr/anna /usr/jon /usr/ted

How do we implement such trees?

Page 13: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

LMC-RSLeftmost-Child, Right-Sibling Tree Representation

Each node has a reference to

1. It’s leftmost child

2. It’s right sibling – the node immediately to the right having the same parent

Advantage: represents trees without limits or pre-specified number of children

Disadvantage: to find the ith child of node n, you must traverse a list n long

Page 14: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }
Page 15: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

Some trees are not binary

/

/bin /dev /usr…

/dev/term /dev/sound /dev/tty01.

/usr/anna /usr/jon /usr/ted

How do we implement such trees?

Page 16: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

LMC-RS

public class Node {

Object data;

Node l_child;

Node r_sibling;

}

Page 17: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

Recursion on Trees

Many algorithms to process trees are designed with a basis (leaves) and induction (interior nodes)

Example: If we have an expression tree we can get

infix (operator between operands - common)

prefix (operator before operands – like function calls)

postfix (operator after operands – good for compilers)

Page 18: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

Expression Tree to Postfix

Basis

For a leaf, just print the operand

Induction:

For an interior node

apply algorithm to each child from left

print the operator

Page 19: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

(x+1)*(x-y+4)

x 1

x y

*

+ -

- 4

x 1 + x y – 4 - *

Page 20: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

Exploring trees

Postorder

visit children, operate on node

Preorder

operate on node, visit children

Page 21: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

(x+1)*(x-y+4)

x 1

x y

*

+ -

- 4

* + x 1 - - x y 4

Page 22: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

Structural Induction

Basis = leaves (one-node trees)

Induction = interior nodes (trees with => 2 nodes)

Assume the statement holds for the subtrees at the children of the root and prove the statement for the whole tree

Page 23: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

Tree Proof Example

Consider a LMC-RS tree

S(T): T has one more reference than it has nodes

Basis: T is a single node – 2 references

Page 24: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

Induction

T has a root r and one or more sub trees T1, T2,…,Tk

BTIH: each of these trees, by itself has one more than nodes

How many nodes all together?How many references?How many nodes do I add to make one tree?How many references do we reduce to make one

tree?

Page 25: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

T1

n1 nodes

n1+1

T2

n2 nodes

n2+1

Tk

nk nodes

nk+1

…

nodesnk

ik

1

)1(1

k

ikn knodes

? ? ?

One more nodeOne more Still “k” extra

Page 26: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

T1

n1 nodes

n1+1

T2

n2 nodes

n2+1

Tk

nk nodes

nk+1

…

nodesnk

ik

1

)1(1

k

ikn knodes

? ? ?

One more nodeOne more Still “k” extra

How many less?

Page 27: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

Example:

S(T): A full binary tree of height h has 2h+1 – 1 nodes

Basis?

Nodes = 1, height == 0, 20+1-1 = 1

Induction?

Page 28: Trees CSC 172 SPRING 2002 LECTURE 14. Lists We have seen lists: public class Node { Object data; Node next; }

T1

h height2 h+1-1 nodes

nodeshh 1)12()12( 11

Height = h+1

T2

h height2 h+1-1 nodes

nodesh 12 2


CSC MOOI Ki Dhani CSC Seekri Chak No 2 CSC Barsani CSC Nokha Gaon WRS CSC Hindoli WRS CSC Ghosunda CSC Kheenwasar GOPAL LAL SAINI CSC Kankoli CSC Jethana CSC 2ML CSC 2 KNJ CSC Jamwa

CSC 1351: Advanced Java - Interdisciplinary - Inventivesbrandt/csc1351/examples/stacks_queues.pdf · CSC 1351: Advanced Java Linked lists, Stacks, Queues Dr Frank L o er [email protected]

LINKED LISTS - York UniversityLinked Lists 2 Singly Linked Lists (3.2) • A singly linked list is a concrete data structure consisting of a sequence of nodes • Each node stores

CSC 550: Introduction to Artificial Intelligence Spring 2004 Scheme programming S-expressions: atoms, lists functional expressions, evaluation primitive

LINKED LISTS - GitHub Pages · Create a singe node linked list Ml Node nti M1 n1 data 10s data nest mi next 2 O's Node 25 ni m2 dates w n2 next 0 Address ofthe nett node data next

6.006- Introduction to Algorithms - courses.csail.mit.edu · 2010-10-15 · Tradeoff: Space • Adjacency lists use one list node per edge – And two machine words per node – So

1 CSC 550: Introduction to Artificial Intelligence Fall 2004 Scheme programming S-expressions: atoms, lists, functional expressions, evaluation primitive

6.2 Node Lists

Finite Element Representation of Muscles...Node 179 Node 204 Node 205 Node 206 Node 227 Node 228 Node 229 Node 264 Node 265 Node 266 Node 277 Node 278 Node 279 Figure 3: Force-strain

1 CSC 221: Introduction to Programming Fall 2011 Lists lists as sequences list operations +, *, len, indexing, slicing, for-in, in example: dice

Linked Lists (Chapter 17.1-17.2, 17.4) - Seattle Universityfac-staff.seattleu.edu/.../teaching/Winter13/cpsc152/LinkedLists.pdf · •Linked lists can insert a node between other

Linked Lists - University of Florida · PDF fileOperations on Singly Linked List • Create list • Add node • Add node at head • Add node at tail • Add node at index i •

wk10.5 - Linked Structures - Simon Fraser University · Linked Structures Chapter 13 ... Linked Lists There are no index values built into linked lists To access each node in the

Linked Lists CSC 171 FALL 2001 LECTURE 20 COURSE EVALUATIONS Tuesday, December 11 th, in Lecture

(c) 2002-2003 University of Washington16-1 CSC 143 Java Lists via Links Reading: Ch. 23

1 CSC 221: Introduction to Programming Fall 2013 Big data building lists list comprehensions, throwaway comprehensions conditional comprehensions processing

Lists Introduction - WordPress.com · inserted or deleted at any position within a list. ... List begins at index 6 node[6] ... C function for inserting a node in a linked list:

Linked Lists CSC220 Winter 2004-5. Array vs Linked List node Array Linked List

1 CSC 221: Introduction to Programming Fall 2012 Lists lists as sequences list operations +, *, len, indexing, slicing, for-in, in example: dice

CSc 120 - University of Arizona• Python lists (aka arrays) • Linked lists • Stacks • Queues • Dequeues Not linear • Dic6onaries • Sets 5 Key property: the way in which

CSC 172 DATA STRUCTURES. SKIP LISTS Read Weiss 10.4.2

Lists, Stacks and Queues. 2 struct Node{ double data; Node* next; }; class List { public: List(); // constructor List(const List& list); // copy constructor

CHAPTER 20 Linked Lists, Queues, and Priority Queues+3E... · Linked Lists, Queues, and Priority Queues Objectives To create nodes to store elements in a linked list ... the node

1 CSC 551: Web Programming Spring 2004 Basic HTML hypertext tags & elements text formatting lists, hyperlinks, images tables, frames cascading

Lists CSC 358/458 4.3.2006. Outline Lab #1 / Homework #1 Lists A question List Internals of Lists List operations Extended Example

PART NUMBER VERSION NUMBER EDITION NUMBER 312597901 … · • Chapter 3, “MVS/CSC Abend Reason Codes” lists abend reason codes for each MVS/CSC module. • Chapter 4, “MVS/CSC

Doubly Linked Lists CS 308 – Data Structures. Node data info: the user's data next, back: the address of the next and previous node in the list.back.next.info

© 2004 Goodrich, Tamassia Node-Lists1 6.2 Node Lists

4.3 Stacks, Queues, and Linked Lists - cis.upenn.educis110/13fa/lectures/43linkedlists.pdf · • A recursive data structure. ... Linked Lists public class Node { ... Two data structures

1 CSC 533: Organization of Programming Languages Spring 2010 Functional programming LISP & Scheme S-expressions: atoms, lists functional expressions,

Singly Linked Lists - York University · 2018-09-13 · © 2014 Goodrich, Tamassia , Goldwasser Singly Linked Lists 3 A Nested Node Class

1 CSC 221: Introduction to Programming Fall 2011 List comprehensions & objects building strings & lists comprehensions conditional comprehensions example:

Chap 3 Linked Lists. Vocabulary Linear List 线性表 Linked List 链表 Retrieval 检索 Traversal 遍历 Node 结点 Circularly Linked Lists 循环链表 Doubly Linked Lists 双向链表

(c) University of Washington16-1 CSC 143 Java Linked Lists Reading: Ch. 20

Chapter 4: Linked Lists - cs.rutgers.eduszhou/351/LinkedLists.pdf · Variations: Doubly Linked Lists • Circular doubly linked list with dummy head node – precede pointer of the