20d49371a33d001d192abbead0da6110

动态演绎2叉树的原理。演示二叉树的前序遍历过程。 演示二叉树的中序遍历过程。 演示二叉树的后序遍历过程。

import org.eclipse.swt.SWT;
import org.eclipse.swt.events.SelectionAdapter;
import org.eclipse.swt.events.SelectionEvent;
import org.eclipse.swt.widgets.Button;
import org.eclipse.swt.widgets.Display;
import org.eclipse.swt.widgets.Shell;

//Jul 2, 20074:39:11 PM
public class BinaryTreeDemonstration
{

	/**
	 * Launch the application
	 * @param args
	 */
	public static void main(String[] args)
	{
		final Display display = Display.getDefault();
		final Shell shell = new Shell(SWT.MIN | SWT.CLOSE | SWT.BORDER);
		shell.setSize(423, 82);
		shell.setText("Welcome to BinaryTree Demonstration Program");
		//

		shell.open();

		final Button button = new Button(shell, SWT.NONE);
		button.addSelectionListener(new SelectionAdapter() {
			@SuppressWarnings("static-access")
			public void widgetSelected(SelectionEvent e)
			{
				shell.dispose();
				CreateBT BT =null;
				BT.main();
				
			}
		});
		button.setText("Create A BinaryTree");
		button.setBounds(29, 9, 163, 31);

		final Button button_1 = new Button(shell, SWT.NONE);
		button_1.addSelectionListener(new SelectionAdapter() {
			public void widgetSelected(SelectionEvent e)
			{
				System.exit(0);
			}
		});
		button_1.setText("Exit");
		button_1.setBounds(221, 9, 163, 31);
		shell.layout();
		while (!shell.isDisposed())
		{
			if (!display.readAndDispatch())
				display.sleep();
		}
	}

}