📄 node.java
字号:
package datastructure;
/**
* <p>Title: </p>
* <p>Description: </p>
* <p>Copyright: Copyright (c) 2004</p>
* <p>Company: </p>
* @author unascribed
* @version 1.0
*/
class Node {
private int weight;
private Node leftNode;
private Node rightNode;
private boolean highlightLeft;
private boolean highlightRight;
private boolean highlight;
int x;
int y;
int depth;
public Node(int i) {
depth = -1;
highlightLeft = false;
highlightRight = false;
highlight = false;
weight = i;
leftNode = rightNode = null;
}
public void setWeight(int i) {
weight = i;
}
public int getWeight() {
return weight;
}
public void setLeftNode(Node node) {
leftNode = node;
}
public void setRightNode(Node node) {
rightNode = node;
}
public Node getLeftNode() {
return leftNode;
}
public Node getRightNode() {
return rightNode;
}
public void setHighlightLeft(boolean flag1) {
highlightLeft = flag1;
}
public boolean getHighlightLeft() {
return highlightLeft;
}
public void setHighlightRight(boolean flag2) {
highlightRight = flag2;
}
public boolean getHighlighthighlightRight() {
return highlightRight;
}
public void setHighlight(boolean flag3) {
highlight = flag3;
}
public boolean getHighlight() {
return highlight;
}
public boolean isLeaf() {
return rightNode == null && leftNode == null;
}
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -