建立二叉树的二叉链表存储结构

Time Limit: 3000ms, Memory Limit: 10000KB , Accepted: 251, Total Submissions: 417
Description

用大写字母标识二叉树结点。试编写递归程序，建立相应的二叉树的二叉链表存储结构

建立相应二叉树的二成叉链表存储结构，并先序遍历输出。

    Sample Input

A(B(#,D),C(E(#,F),#))

    Sample Output

AB#DCE#F#

[此贴子已经被作者于2018-5-27 11:44编辑过]

这是？

数据结构的作业，打了好多天了，哭唧唧

public class Untitled {
    //A(B(#,D),C(E(#,F),#))
    //AB#DCE#F#
    public static void main(String[] args) {
        Node root = new Node("A");
        root.lchild= new Node("B");
        Node node = root.lchild;
        node.lchild = new Node("#");
        node.rchild = new Node("D");
        root.rchild= new Node("C");
        node = root.rchild;
        node.lchild = new Node("E");
        node.rchild = new Node("#");
        node = node.lchild;
        node.lchild = new Node("#");    
        node.rchild = new Node("F");        
        fDisplay(root);
    }
    public static void fDisplay(Node node){
        if(node!=null){
            System.out.printf("%s",node.name);
            fDisplay(node.lchild);
            fDisplay(node.rchild);
        }
    }
        
}
class Node{
    String name;
    Node lchild;
    Node rchild;
    public Node(String name){
        this.name = name;
    }
}

[此贴子已经被作者于2018-5-27 13:19编辑过]

多谢学姐，但是我不会用java

那你用的啥？我查查api

codeblocks

c?

C语言

#include <stdio.h>
#include <malloc.h>
#include <string.h>
typedef struct Node{
    struct Node *lchild;
    struct Node *rchild;
    char name[20];
}Node;
void fDisplay(Node *node){
    if(node!=NULL){
        printf("%s",node->name);
        fDisplay(node->lchild);
        fDisplay(node->rchild);
    }
}
Node* newNode(char name[]){
    Node *node = (Node*)malloc(sizeof(Node));
    strcpy(node->name,name);
    return node;
}

int main () {    
    //A(B(#,D),C(E(#,F),#))
    //AB#DCE#F#
    Node *root = newNode("A");
    root->lchild= newNode("B");
    Node *node = root->lchild;
    node->lchild = newNode("#");
    node->rchild = newNode("D");
    root->rchild= newNode("C");
    node = root->rchild;
    node->lchild = newNode("E");
    node->rchild = newNode("#");
    node = node->lchild;
    node->lchild = newNode("#");    
    node->rchild = newNode("F");        
    fDisplay(root);
    return 0;
}