📄 arraylistcompletebinarytree-vectorheap.html
字号:
<html><head><title>Code Fragment</title></head><body text=#000000><center></center><br><br><dl><dd><pre><font color=#8000a0>public</font> <font color=#8000a0><font color=#ff8000>class</font> </font>ArrayListCompleteBinaryTree<E> <font color=#8000a0><font color=#ff8000>implements</font> </font>CompleteBinaryTree<E> { <font color=#8000a0><font color=#8000a0>protected</font> </font>ArrayList<BTPos<E>> T; <font color=#ff0080>// indexed list of tree positions</font> <font color = #ff0080>/** Nested class for a index list-based complete binary tree node. */</font> <font color=#8000a0><font color=#8000a0>protected</font> </font><font color=#8000a0>static</font> <font color=#8000a0><font color=#ff8000>class</font> </font>BTPos<E> <font color=#8000a0><font color=#ff8000>implements</font> </font>Position<E> { <font color=#8000a0>E </font>element; <font color=#ff0080>// element stored at this position</font> <font color=#8000a0><font color=#8000a0>int</font> </font>index; <font color=#ff0080>// index of this position in the array list</font> <font color=#8000a0><font color=#8000a0>public</font> </font><font color=#0000ff>BTPos</font>(E elt, <font color=#8000a0><font color=#8000a0>int</font> </font>i) { element = elt; index = i; } <font color=#8000a0><font color=#8000a0>public</font> </font>E <font color=#0000ff>element</font>() { <font color=#8000a0><font color=#ff8000>return</font> </font>element; } <font color=#8000a0><font color=#8000a0>public</font> </font><font color=#8000a0>int</font> <font color=#0000ff>index</font>() { <font color=#8000a0><font color=#ff8000>return</font> </font>index; } <font color=#8000a0><font color=#8000a0>public</font> </font>E <font color=#0000ff>setElement</font>(E elt) { <font color=#8000a0>E </font>temp = element; element = elt; <font color=#8000a0><font color=#ff8000>return</font> </font>temp; } } <font color = #ff0080>/** default constructor */</font> <font color=#8000a0><font color=#8000a0>public</font> </font><font color=#0000ff>ArrayListCompleteBinaryTree</font>() { T = <font color=#8000a0><font color=#ff8000>new</font> </font>ArrayList<BTPos<E>><font color=#0000ff></font>(); T.<font color=#0000ff>add</font>(0, null); <font color=#ff0080>// the location at rank 0 is deliberately empty</font> } <font color = #ff0080>/** Returns the number of (internal and external) nodes. */</font> <font color=#8000a0><font color=#8000a0>public</font> </font><font color=#8000a0>int</font> <font color=#0000ff>size</font>() { <font color=#8000a0><font color=#ff8000>return</font> </font>T.<font color=#0000ff>size</font>() - 1; } <font color = #ff0080>/** Returns whether the tree is empty. */</font> <font color=#8000a0><font color=#8000a0>public</font> </font><font color=#8000a0>boolean</font> <font color=#0000ff>isEmpty</font>() { <font color=#ff8000>return</font><font color=#0000ff> </font>(<font color=#0000ff>size</font>() == 0); } </dl></body></html>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -