binarytree-tree.html
来自「经典的数据结构源代码（java 实现）」· HTML 代码 · 共 29 行
HTML
29 行
<html><head><title>Code Fragment</title></head><body text=#000000><center></center><br><br><dl><dd><pre><font color=#ff0080>/** * An interface for a binary tree, where each node can have zero, one, * or two children. */</font><font color=#8000a0>public</font> <font color=#8000a0><font color=#ff8000>interface</font> </font>BinaryTree<E> <font color=#8000a0><font color=#ff8000>extends</font> </font>Tree<E> { <font color = #ff0080>/** Returns the left child of a node. */</font> <font color=#8000a0><font color=#8000a0>public</font> </font>Position<E> <font color=#0000ff>left</font>(Position<E> v) <font color=#8000a0><font color=#ff8000>throws</font> </font>InvalidPositionException, BoundaryViolationException; <font color = #ff0080>/** Returns the right child of a node. */</font> <font color=#8000a0><font color=#8000a0>public</font> </font>Position<E> <font color=#0000ff>right</font>(Position<E> v) <font color=#8000a0><font color=#ff8000>throws</font> </font>InvalidPositionException, BoundaryViolationException; <font color = #ff0080>/** Returns whether a node has a left child. */</font> <font color=#8000a0><font color=#8000a0>public</font> </font><font color=#8000a0>boolean</font> <font color=#0000ff>hasLeft</font>(Position<E> v) <font color=#8000a0><font color=#ff8000>throws</font> </font>InvalidPositionException; <font color = #ff0080>/** Returns whether a node has a right child. */</font> <font color=#8000a0><font color=#8000a0>public</font> </font><font color=#8000a0>boolean</font> <font color=#0000ff>hasRight</font>(Position<E> v) <font color=#8000a0><font color=#ff8000>throws</font> </font>InvalidPositionException;}</dl></body></html>⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?