数据结构
网络
RDBMS
操作系统
Java
MS Excel
iOS
HTML
CSS
Android
Python
C 编程
C++
C#
MongoDB
MySQL
Javascript
PHP
物理
化学
生物
数学
英语
经济学
心理学
社会学
时尚研究
法律研究Java 程序，用于从 JTree 获取上一个兄弟节点
使用 getPreviousSibling() 方法来获取上一个兄弟节点。在此，我们获取了子节点“five”的上一个兄弟节点，并在控制台中显示 −
System.out.println("Get Previous Sibling = "+five.getPreviousSibling());以下是 Java 程序从 JTree 获取上一个兄弟节点的示例 −
示例
package my;
import javax.swing.JFrame;
import javax.swing.JTree;
import javax.swing.tree.DefaultMutableTreeNode;
public class SwingDemo {
public static void main(String[] args) throws Exception {
JFrame frame = new JFrame("Demo");
DefaultMutableTreeNode node = new DefaultMutableTreeNode("Products");
DefaultMutableTreeNode node1 = new DefaultMutableTreeNode("Clothing (Product1 - P66778)");
DefaultMutableTreeNode node2 = new DefaultMutableTreeNode("Accessories (Product2 - P66779)");
DefaultMutableTreeNode node3 = new DefaultMutableTreeNode("Home Decor (Product3 - P66780)");
DefaultMutableTreeNode node4 = new DefaultMutableTreeNode("Electronics (Product4 - P66781)");
node.add(node1);
node.add(node2);
node.add(node3);
node.add(node4);
DefaultMutableTreeNode one = new DefaultMutableTreeNode("Shirt");
DefaultMutableTreeNode two = new DefaultMutableTreeNode("T-shirt");
DefaultMutableTreeNode three = new DefaultMutableTreeNode("Hoodie");
DefaultMutableTreeNode four = new DefaultMutableTreeNode("Sunglasses");
DefaultMutableTreeNode five = new DefaultMutableTreeNode("Frames");
DefaultMutableTreeNode six = new DefaultMutableTreeNode("Belts");
DefaultMutableTreeNode seven = new DefaultMutableTreeNode("Showpieces & Figurines");
DefaultMutableTreeNode eight = new DefaultMutableTreeNode("Clocks");
DefaultMutableTreeNode nine = new DefaultMutableTreeNode("Wall Shelves");
DefaultMutableTreeNode ten = new DefaultMutableTreeNode("Mobile Accessories");
DefaultMutableTreeNode eleven = new DefaultMutableTreeNode("Smart Wearable Tech");
DefaultMutableTreeNode twelve = new DefaultMutableTreeNode("Health Care Applicances");
DefaultMutableTreeNode thirteen = new DefaultMutableTreeNode("Smart Home Automation");
node1.add(one);
node1.add(two);
node1.add(three);
node2.add(four);
node2.add(five);
node2.add(six);
node3.add(seven);
node3.add(eight);
node3.add(nine);
node4.add(ten);
node4.add(eleven);
node4.add(twelve);
node4.add(thirteen);
JTree tree = new JTree(node);
for (int i = 0; i < tree.getRowCount(); i++) {
tree.expandRow(i);
}
tree.putClientProperty("JTree.lineStyle", "Angled");
System.out.println("Get Previous Leaf = "+eight.getPreviousLeaf());
System.out.println("Get Previous Leaf = "+node3.getPreviousLeaf());
System.out.println("Get Previous Node = "+eight.getPreviousNode());
System.out.println("Get Previous Node = "+node3.getPreviousNode());
System.out.println("Get Previous Sibling = "+five.getPreviousSibling());
tree.setRowHeight(25);
frame.add(tree);
frame.setSize(600,450);
frame.setVisible(true);
}
}输出如下，显示上一个兄弟节点 −
输出
以下是我们的 JTree −
更新日期：30-Jul-2019
130 次浏览
广告