page157.html

来自「Data Structures And Algorithms With Obje」· HTML 代码 · 共 38 行

HTML
38 行
字号 
<HTML><HEAD><TITLE>Implementation</TITLE></HEAD><BODY bgcolor="#FFFFFF"> <a href="../index.html" target="_top"><img src="../icons/usins.gif" alt="Logo" align=right></a><b>Data Structures and Algorithms with Object-Oriented Design Patterns in Python</b><br><A NAME="tex2html3011" HREF="page158.html"><IMG WIDTH=37 HEIGHT=24 ALIGN=BOTTOM ALT="next" SRC="../icons/next_motif.gif"></A> <A NAME="tex2html3009" HREF="page156.html"><IMG WIDTH=26 HEIGHT=24 ALIGN=BOTTOM ALT="up" SRC="../icons/up_motif.gif"></A> <A NAME="tex2html3005" HREF="page156.html"><IMG WIDTH=63 HEIGHT=24 ALIGN=BOTTOM ALT="previous" SRC="../icons/previous_motif.gif"></A>  <A NAME="tex2html3013" HREF="page611.html"><IMG WIDTH=43 HEIGHT=24 ALIGN=BOTTOM ALT="index" SRC="../icons/index_motif.gif"></A> <BR><HR><H3><A NAME="SECTION006231000000000000000">Implementation</A></H3><P>Program&nbsp;<A HREF="page157.html#progalgorithmsa"><IMG  ALIGN=BOTTOM ALT="gif" SRC="../icons/cross_ref_motif.gif"></A> definesthe method <tt>breadthFirstTraversal</tt>.This method takes as its argumentany instance of a class dervied from the abstract <tt>Tree</tt> class.The idea is that the method is passed the root of the tree to be traversed.The algorithm makes use of the <tt>QueueAsLinkedList</tt> data structure,which was defined in the preceding section,to hold the appropriate tree nodes.<P>The running time of the <tt>breadthFirstTraversal</tt>algorithm depends on the number of nodes in the tree which is being traversed.Each node of the tree is enqueued exactly once--this requires a constant amount of work.Furthermore, in each iteration of the loop,each node is dequeued exactly once--again a constant amount of work.As a result, the running time of the <tt>breadthFirstTraversal</tt> algorithmis <I>O</I>(<I>n</I>) where <I>n</I> is the number of nodes in the traversed tree.<P><P><A NAME="7360">&#160;</A><A NAME="progalgorithmsa">&#160;</A> <IMG WIDTH=575 HEIGHT=238 ALIGN=BOTTOM ALT="program7357" SRC="img700.gif"  ><BR><STRONG>Program:</STRONG> Queue application--breadth-first tree traversal.<BR><P><HR><A NAME="tex2html3011" HREF="page158.html"><IMG WIDTH=37 HEIGHT=24 ALIGN=BOTTOM ALT="next" SRC="../icons/next_motif.gif"></A> <A NAME="tex2html3009" HREF="page156.html"><IMG WIDTH=26 HEIGHT=24 ALIGN=BOTTOM ALT="up" SRC="../icons/up_motif.gif"></A> <A NAME="tex2html3005" HREF="page156.html"><IMG WIDTH=63 HEIGHT=24 ALIGN=BOTTOM ALT="previous" SRC="../icons/previous_motif.gif"></A>  <A NAME="tex2html3013" HREF="page611.html"><IMG WIDTH=43 HEIGHT=24 ALIGN=BOTTOM ALT="index" SRC="../icons/index_motif.gif"></A> <P><ADDRESS><img src="../icons/bruno.gif" alt="Bruno" align=right><a href="../copyright.html">Copyright &#169; 2003</a> by <a href="../signature.html">Bruno R. Preiss, P.Eng.</a>  All rights reserved.</ADDRESS></BODY></HTML>

page157.html - 源码说明

本页面展示了「Data Structures And Algorithms With Object-Oriented Design Patterns In Python (2003) source code and」中的 page157.html 源码文件，采用 HTML 编程语言编写，共 38 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫下载站收录了大量与Object-Oriented相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?